Extended temporal logic on finite words and wreath product of monoids with distinguished generators

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

Volumn 2450, Issue , 2003, Pages 43-58

  ÉSik, ZoltÁn ^a  

^a UNIVERSITY OF SZEGED   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA;

FINITE WORDS; MODAL OPERATORS; MONOIDS; WREATH PRODUCTS;

COMPUTER CIRCUITS;

EID: 33745721816     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45005-x_4     Document Type: Conference Paper

References (14)

1. J. Almeida, Finite Semigroups and Universal Algebra, World Scientific, 1994.
2. A. Baziramwabo, P. McKenzie and D. Therien, Modular temporal logic, in: Proc. 1999 IEEE Conference LICS, Trento, Italy.
3. J. Cohen, J.-E. Pin and D. Perrin, On the expressive power of temporal logic, J. Computer and System Sciences, 46(1993), 271–294.
4. P. Dömösi and Z. Ésik, Critical classes for the α0-product, Theoretical Computer Science, 61(1988), 17–24.
5. S. Eilenberg, Automata, Languages, and Machines, vol. A and B, Academic Press, 1974 and 1976.
6. Z. Ésik and M. Ito, Temporal logic with cyclic counting and the degree of aperiodicity of finite automata, Acta Cybernetica, to appear.
7. Z. Ésik and K. G. Larsen, Regular languages definable by Lindström quantifiers, BRICS Reports, RS-02-20, April, 2002.
8. J. A. Kamp, Tense logic and the theory of linear order, Ph. D. Thesis, UCLA, 1968.
9. R. McNaughton and S. Papert, Counter-Free Automata, MIT Press, 1971.
10. A. Pnueli, The temporal logic of programs, in: Proc. 18th FOCS, Providence, RI, IEEE Press, 1977, 46–57.
11. H. Straubing, Finite Automata, Formal Logic, and Circuit Complexity, Birkhauser, 1994.
12. H. Straubing, D. Therien and W. Thomas, Regular languages defined with generalized quantifiers, Information and Computation, 118(1995), 289–301.
13. D. Therien and Th. Wilke, Temporal logic and semidirect products: An effective characterization of the until hierarchy, DIMACS TR-96-28, 1996.
14. P. Wolper, Temporal logic can be more expressive, Information and Control, 56(1983), 72–99.