paint-brush
Temporal Hierarchies of Regular Languages: Missing Arguments for the Intermediary Statementsby@hierarchy

Temporal Hierarchies of Regular Languages: Missing Arguments for the Intermediary Statements

by HierarchyJanuary 31st, 2025
Read on Terminal Reader
Read this story w/o Javascript
tldt arrow

Too Long; Didn't Read

This appendix is devoted to the missing arguments for the intermediary statements in the proof of Theorem 30
featured image - Temporal Hierarchies of Regular Languages: Missing Arguments for the Intermediary Statements
Hierarchy HackerNoon profile picture
0-item

Abstract and 1 Introduction

2 Preliminaries

3 Temporal Hierarchies

4 Rating Maps

5 Optimal Imprints for TL(AT)

6 Conclusion and References


Appendix A. Appendix to Section 2 & Appendix B. Appendix to Section 3

Appendix C. Appendix to Section 4 & Appendix D. Appendix to Section 5

Appendix C. Appendix to Section 4

We now prove Proposition 27.



Appendix D. Appendix to Section 5


This paper is available on arxiv under CC BY 4.0 DEED license.

Authors:

(1) Thomas Place;

(2) Marc Zaitoun.