This story draft by @escholar has not been reviewed by an editor, YET.

Temporal hierarchies of regular languages: Appendix to Section 2

EScholar: Electronic Academic Papers for Scholars HackerNoon profile picture

Authors:

(1) Thomas Place;

(2) Marc Zaitoun.

Table of Links

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 A. Appendix to Section 2

In this section, we present additional terminology used in proof arguments throughout the appendix. First, we introduce ordered monoids, which are used to handle classes that may not be closed under complement (we need them to deal with the classes Pol(C)). Then, we introduce the notion of C-morphism for a positive prevariety C, which is a key mathematical tool.




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


L O A D I N G
. . . comments & more!

About Author

EScholar: Electronic Academic Papers for Scholars HackerNoon profile picture
EScholar: Electronic Academic Papers for Scholars@escholar
We publish the best academic work (that's too often lost to peer reviews & the TA's desk) to the global tech community

Topics

Around The Web...

Trending Topics

blockchaincryptocurrencyhackernoon-top-storyprogrammingsoftware-developmenttechnologystartuphackernoon-booksBitcoinbooks