Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators
We associate a modal operator with each language belonging to a given class of regular languages and use the (reverse) wreath product of monoids with distinguished generators to characterize the expressive power of the resulting logic.
Unable to display preview. Download preview PDF.
- 1.J. Almeida, Finite Semigroups and Universal Algebra, World Scientific, 1994.Google Scholar
- 2.A. Baziramwabo, P. McKenzie and D. Therien, Modular temporal logic, in: Proc. 1999 IEEE Conference LICS, Trento, Italy.Google Scholar
- 5.S. Eilenberg, Automata, Languages, and Machines, vol. A and B, Academic Press, 1974 and 1976.Google Scholar
- 6.Z. Ésik and M. Ito, Temporal logic with cyclic counting and the degree of aperiodicity of finite automata, Acta Cybernetica, to appear.Google Scholar
- 7.Z. Ésik and K. G. Larsen, Regular languages definable by Lindström quantifiers, BRICS Reports, RS-02-20, April, 2002.Google Scholar
- 8.J. A. Kamp, Tense logic and the theory of linear order, Ph. D. Thesis, UCLA, 1968.Google Scholar
- 9.R. McNaughton and S. Papert, Counter-Free Automata, MIT Press, 1971.Google Scholar
- 10.A. Pnueli, The temporal logic of programs, in: Proc. 18th FOCS, Providence, RI, IEEE Press, 1977, 46–57.Google Scholar
- 11.H. Straubing, Finite Automata, Formal Logic, and Circuit Complexity, Birkhauser, 1994.Google Scholar
- 13.D. Therien and Th. Wilke, Temporal logic and semidirect products: An effective characterization of the until hierarchy, DIMACS TR-96-28, 1996.Google Scholar