Temporal logic with cyclic counting and the degree of aperiodicity of finite automata

Acta Cybernetica

Volumn 16, Issue 1, 2003, Pages 1-28

  Esik Z ^a   Ito, M ^b  

^a UNIVERSITY OF SZEGED   (Hungary)

^b KYOTO SANGYO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 18744436808     PISSN: 0324721X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (22)

1. 1, J. Comput. Sys. Sci., 44(1992), 478-499.
2. A. Bazirambawo, P. McKenzie and D. Therien, Modular temporal logic, Proc. 1999 IEEE Conf. LICS, Trento, Italy, IEEE Press, 1999, 344-351.
3. R. Büchi, Weak second-ordor arithmetic and finite automata, Z. Math. Logik Grundlag. Math., 6(1960), 66-92.
4. J. Cohen, D. Perrin and J.-E. Pin, On the expressive power of temporal logic, J. Comp. Sys. Sci., 46(1993), 271-294.
5. S. Eilenberg, Automata, Languages and Machines, v. A and B., Academic Press, 1974 and 1976.
6. C. C. Elgot, Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc., 98(1961), 21-51.
7. 0-products, Theoret. Comp. Sci., 87(1991), 229-249.
8. D. M. Gabbay, A. Pnueli, S. Shelah and J. Stavi, On the temporal analysis of fairness, in: proc. 12th ACM Symp. Principles of Programming Languages, Las Vegas, 1980, 163-173.
9. F. Gécseg and I. Peák, Algebraic Theory of Automata, Akadémiai Kiadó. Budapest, 1972.
10. J. A. Kamp, Tense Logic and the Theory of Linear Order, Ph. D. Thesis, UCLA, 1968.
11. R. McNaughton and S. Papert, Counter-Free Automata, MIT Press, 1971.
12. J.-E. Pin, Varieties of Formal Languages, North Oxford Academic, 1986.
13. A. Pnueli, The temporal logic of programs, in: proc. 18th IEEE Symp. Foundations of Computer Science, Providence, RI, 1977, 46-57.
14. M. P. Schützenberger, On finite monoids having only trivial subgroups, Inform. Camp., 8(1965), 190-194.
15. H. Straubing, Constant-depth periodic circuits, Int. J. Algebra and Computation, 1(1991), 45-88.
16. H. Straubing, Finite Automata, Formal Logic and Circuit Complexity, Birkhauser, 1994.
17. H. Straubing, D. Therien and W. Thomas, Regular languages defined with generalized quantifiers, Information and computation, 118(1995), 289-301.
18. W. Thomas, Automata on infinite objects, in: Handbook of Theoretical Computer Science, Vol. B, Elsevier, Amsterdam, 1990, 133-191.
19. W. Thomas, Languages, automata, and logic, in: Handbook of Formal Language Theory, Vol. III, (G. Rozenberg, A. Salomaa, Eds.), Springer-Verlag, New York, 1997, 389-455.
20. Th. Wilke, Classifying discrete temporal properties, in: proc. STACS 99, Trier, 1999, LNCS 1563, Springer, 1999, 32-46.
21. M. Y. Vardi and P. Wolper, Reasoning about infinite computation, Information and Computation, 115(1994), 1-37.
22. P. Wolper, Temporal logic can be more expressive, Information and Control, 56(1983), 72-99. (Pubitemid 14570587)