Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators

  • Zoltán Ésik
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2450)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. Almeida, Finite Semigroups and Universal Algebra, World Scientific, 1994.Google Scholar
  2. 2.
    A. Baziramwabo, P. McKenzie and D. Therien, Modular temporal logic, in: Proc. 1999 IEEE Conference LICS, Trento, Italy.Google Scholar
  3. 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.MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    P. Dömösi and Z. Ésik, Critical classes for the α0-product, Theoretical Computer Science, 61(1988), 17–24.MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    S. Eilenberg, Automata, Languages, and Machines, vol. A and B, Academic Press, 1974 and 1976.Google Scholar
  6. 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. 7.
    Z. Ésik and K. G. Larsen, Regular languages definable by Lindström quantifiers, BRICS Reports, RS-02-20, April, 2002.Google Scholar
  8. 8.
    J. A. Kamp, Tense logic and the theory of linear order, Ph. D. Thesis, UCLA, 1968.Google Scholar
  9. 9.
    R. McNaughton and S. Papert, Counter-Free Automata, MIT Press, 1971.Google Scholar
  10. 10.
    A. Pnueli, The temporal logic of programs, in: Proc. 18th FOCS, Providence, RI, IEEE Press, 1977, 46–57.Google Scholar
  11. 11.
    H. Straubing, Finite Automata, Formal Logic, and Circuit Complexity, Birkhauser, 1994.Google Scholar
  12. 12.
    H. Straubing, D. Therien and W. Thomas, Regular languages defined with generalized quantifiers, Information and Computation, 118(1995), 289–301.MATHCrossRefMathSciNetGoogle Scholar
  13. 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
  14. 14.
    P. Wolper, Temporal logic can be more expressive, Information and Control, 56(1983), 72–99.MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Zoltán Ésik
    • 1
  1. 1.Dept. of Computer ScienceUniversity of SzegedSzegedHungary

Personalised recommendations