Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2450))

Included in the following conference series:

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.

Supported in part by a grant from the National Foundation of Hungary for Scientific Research and by the Japan Society for the Promotion of Science.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  4. P. Dömösi and Z. Ésik, Critical classes for the α0-product, Theoretical Computer Science, 61(1988), 17–24.

    Article  MATH  MathSciNet  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 

  12. H. Straubing, D. Therien and W. Thomas, Regular languages defined with generalized quantifiers, Information and Computation, 118(1995), 289–301.

    Article  MATH  MathSciNet  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 

  14. P. Wolper, Temporal logic can be more expressive, Information and Control, 56(1983), 72–99.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University of Szeged, P.O.B. 652, 6701, Szeged, Hungary

    Zoltán Ésik

Authors
  1. Zoltán Ésik
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Science and Faculty of Engineering, Kyoto Sangyo University, 603-8555, Kyoto, Japan

    Masami Ito  & Masafumi Toyama  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ésik, Z. (2003). Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators. In: Ito, M., Toyama, M. (eds) Developments in Language Theory. DLT 2002. Lecture Notes in Computer Science, vol 2450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45005-X_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-45005-X_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40431-6

  • Online ISBN: 978-3-540-45005-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation