Skip to main content
SpringerLink
Log in

Hierarchies of Piecewise Testable Languages

  • Conference paper
Developments in Language Theory (DLT 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5257))

Included in the following conference series:

Abstract

The classes of languages which are boolean combinations of languages of the form

$$A^*a_1A^*a_2A^*\dots A^*a_\ell A^*, \text{ where } a_1,\dots ,a_\ell\in A,\ \ell\le k\,,$$

for a fixed k ≥ 0, form a natural hierarchy within piecewise testable languages and have been studied in papers by Simon, Blanchet-Sadri, Volkov and others. The main issues were the existence of finite bases of identities for the corresponding pseudovarieties of monoids and generating monoids for these pseudovarieties.

Here we deal with similar questions concerning the finite unions and positive boolean combinations of the languages of the form above. In the first case the corresponding pseudovarieties are given by a single identity, in the second case there are finite bases for k equal to 1 and 2 and there is no finite basis for k ≥ 4 (the case k = 3 remains open). All the pseudovarieties are generated by a single algebraic structure.

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.

Similar content being viewed by others

References

  1. Almeida, J.: Implicit operations on finite \(\mathcal J\)-trivial semigroups and a conjecture of I. Simon. J. Pure Appl. Algebra 69, 205–218 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  2. Almeida, J.: Finite Semigroups and Universal Algebra. World Scientific, Singapore (1994)

    MATH  Google Scholar 

  3. Blanchet-Sadri, F.: Games, equations and the dot-depth hierarchy. Comput. Math. Appl. 18, 809–822 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  4. Blanchet-Sadri, F.: Equations and monoids varieties of dot-depth one and two. Theoret. Comput. Sci. 123, 239–258 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  5. Eilenberg, S.: Automata, Languages and Machines, vol. B. Academic Press, New York (1976)

    MATH  Google Scholar 

  6. Ésik, Z., Ito, M.: Temporal logic with cyclic counting and the degree of aperiodicity of finite automata. Acta Cybernetica 16, 1–28 (2003)

    MATH  MathSciNet  Google Scholar 

  7. Higgins, P.: A proof of Simon’s Theorem on piecewise testable languages. Theoret. Comput. Sci. 178, 257–264 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  8. Klíma, O., Polák, L.: Classes of meet automata. Theoret. Comput. Sci. (to appear)

    Google Scholar 

  9. Klíma, O., Polák, L.: Hierarchies of piecewise testable languages, a version containing also Appendix, http://www.math.muni.cz/~polak

  10. Pin, J.-E.: Varieties of Formal Languages. North Oxford Academic, Plenum (1986)

    Google Scholar 

  11. Pin, J.-E.: Finite semigroups and recognizable languages: an introduction. In: Fountain, J. (ed.) NATO Advanced Study Institute Semigroups, Formal Languages and Groups, pp. 1–32. Kluwer Academic Publisher, Dordrecht (1995)

    Google Scholar 

  12. Pin, J.-E.: A variety theorem without complementation. Russian Mathem (Iz. VUZ) 39, 74–83 (1995)

    MATH  MathSciNet  Google Scholar 

  13. Pin, J.-E.: Syntactic semigroups. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, ch. 10. Springer, Heidelberg (1997)

    Google Scholar 

  14. Pin, J.-E., Weil, P.: Polynomial closure and unambiguous product. Theory Comput. Syst. 30, 1–39 (1997)

    Article  MathSciNet  Google Scholar 

  15. Polák, L.: A classification of rational languages by semilattice-ordered monoids. Arch. Math. (Brno) 40, 395–406 (2004)

    MATH  MathSciNet  Google Scholar 

  16. Polák, L.: On pseudovarieties of semiring morphisms. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 635–647. Springer, Heidelberg (2004)

    Google Scholar 

  17. Simon, I.: Hierarchies of events of dot-depth one, Ph.D. thesis, University of Waterloo (1972)

    Google Scholar 

  18. Simon, I.: Piecewise testable events. In: Proc. ICALP 1975. LNCS, vol. 33, pp. 214–222. Springer, Heidelberg (1975)

    Google Scholar 

  19. Stern, J.: Characterization of some classes of regular events. Theoret. Comput. Sci. 35, 17–42 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  20. Straubing, H.: On finite \(\mathcal J\)-trivial monoids. Semigroup Forum 19, 107–110 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  21. Straubing, H.: On logical description of regular languages. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, pp. 528–538. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  22. Straubing, H., Thérien, D.: Partially ordered finite monoids and a theorem of I. Simon. J. Algebra 119, 393–399 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  23. Volkov, M.V.: Reflexive relations, extensive transformations and piecewise testable languages of a given height. Internat. J. Algebra Comput. 14, 817–827 (2004)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Masaryk University, Janáčkovo nám 2a, 662 95, Brno, Czech Republic

    Ondřej Klíma & Libor Polák

Authors
  1. Ondřej Klíma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Libor Polák
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Masami Ito Masafumi Toyama

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Klíma, O., Polák, L. (2008). Hierarchies of Piecewise Testable Languages. In: Ito, M., Toyama, M. (eds) Developments in Language Theory. DLT 2008. Lecture Notes in Computer Science, vol 5257. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85780-8_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85780-8_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85779-2

  • Online ISBN: 978-3-540-85780-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation