A logical approach to decidability of hierarchies of regular star-free languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2010, Issue , 2001, Pages 539-550

  Selivanov, Victor L ^a  

^a A P ERSHOV INSTITUTE OF INFORMATICS SYSTEMS   (Russian Federation)

Author keywords

Decidability; Definability; Hierarchies; Star free regular languages

Indexed keywords

CONTINUOUS TIME SYSTEMS; HYBRID SYSTEMS; STARS;

CONTINUOUS-TIME; DECIDABILITY PROBLEMS; DEFINABILITY; HIERARCHIES; LOGICAL APPROACHES; PRESERVATION THEOREMS; STAR-FREE LANGUAGES; TREE THEOREM;

COMPUTABILITY AND DECIDABILITY;

EID: 84957058522     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44693-1_47     Document Type: Conference Paper

References (20)

1. J. Addison. The method of alternating chains. In: The theory of models, North Holland, Amsterdam, 1965, 1-16.
2. C. Cho rut and J. Karumäki. Combinatirics of words. In: Handbook of Formal Languages (G. Rozenberg and A. Salomaa, ed.), v. 1 Springer, 1996, 329-438.
3. C.C. Chang, H.J. Keisler. Model theory, North Holland, Amsterdam, 1973.
4. C. Glasser, H. Schmitz. The Boolean structure of dot-depth one. J. Automata, Languages and Combinatorics, to appear.
5. A.I. Malcev. Algebraic Systems, Springer, Berlin, 1971.
6. R. McNaughton and S. Papert. Counter-free automata. MIT Press, Cambridge, Massachusets, 1971.
7. D. Perrin and J.E. Pin. First order logic and star-free sets. J. Comp. and Syst. Sci., 32 (1986), 393-406.
8. J.E. Pin. Varieties of Formal Languages. Plenum, London, 1986. Pin94. J.E. Pin. Logic on words. Bulletin of the EATCS, 54 (1994), 145-165.
9. M.O. Rabin. Decidability of second order theories and automata on infinite trees. Trans. Amer. Math. Soc., 141 (1969), 1-35.
10. A. Robinson. Introduction to Model Theory and to the Metamathematics of Algebra, North Holland, Amsterdam, 1963.
11. Schmitz. Restricted temporal logic and deterministic languages. J. Automata, Languages and Combinatorics, 5 (2000), 325-342.
12. V.L. Selivanov. Fine hierarchy of formulas. Algebra i Logika, 30 (1991), 568-583 (Russian, English translation: Algebra and Logic, 30 (1991), 368-379).
13. V.L. Selivanov. Fine hierarchies and definable index sets. Algebra i logika, 30, No 6 (1991), 705-725 (Russian, English translation: Algebra and logic, 30 (1991), 463-475).
14. V.L. Selivanov. Computing degrees of definable classes of sentences. Con- temporary Math., 131, part 3 (1992), 657-666.
15. V.L. Selivanov. Fine hierarchies and Boolean terms. J. Symbolic Logic, 60 (1995), 289-317.
16. J.R. Shoen field. Mathematical Lodic, Addison-Wesley, 1967.
17. J. Stern. Characterizations of some classes of regular events. Theor. Comp. Science, 35 (1985), 17-42.
18. H. Schmitz and K. Wagner. The Boolean hierarchy over level 1/2 of the Sraubing-Therien hierarchy, to appear (currently available at http://www.informatik.uni-wuerzburg.de).
19. W. Thomas. Classifying regular events in symbolic logic. J. Comp. and Syst. Sci.,25 (1982), 360-376.
20. A.N. Trahtman. Computing the order of local testability. In: Proc. 1st Int. Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, Magdeburg, 1999, 197-206.