Skip to main content
SpringerLink
Log in

Operational Characterization of Scattered MCFLs

  • Conference paper
Developments in Language Theory (DLT 2013)

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

Included in the following conference series:

Abstract

We give a Kleene-type operational characterization of Muller context-free languages (MCFLs) of well-ordered and scattered words.

The publication is supported by the European Union and co-funded by the European Social Fund. Project title: “Telemedicine-focused research activities on the field of Matematics, Informatics and Medical sciences”, Project number: TAMOP-4.2.2.A-11/1/KONV-2012-0073.

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. de Bakker, J.W., Scott, D.: A theory of programs. IBM Seminar Vienna (August 1969)

    Google Scholar 

  2. Bedon, N.: Finite automata and ordinals. Theoretical Computer Science 156, 119–144 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bedon, N., Bès, A., Carton, O., Rispal, C.: Logic and rational languages of words indexed by linear orderings. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds.) Computer Science – Theory and Applications. LNCS, vol. 5010, pp. 76–85. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  4. Bekić, H.: Definable operations in general algebras, and the theory of automata and flowcharts. IBM Seminar Vienna (December 1969)

    Google Scholar 

  5. Bès, A., Carton, O.: A Kleene theorem for languages of words indexed by linear orderings. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol. 3572, pp. 158–167. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Bloom, S.L., Ésik, Z.: Iteration Theories. EATCS Monograph Series in Theoretical Computer Science. Springer (1993)

    Google Scholar 

  7. Boasson, L.: Context-free sets of infinite words. In: Weihrauch, K. (ed.) GI-TCS 1979. LNCS, vol. 67, pp. 1–9. Springer, Heidelberg (1979)

    Google Scholar 

  8. Bruyère, V., Carton, O.: Automata on linear orderings. J. Computer and System Sciences 73, 1–24 (2007)

    Article  MATH  Google Scholar 

  9. Büchi, J.R.: The monadic second order theory of ω 1. In: Decidable theories, II. Lecture Notes in Math, vol. 328, pp. 1–127. Springer, Heidelberg (1973)

    Chapter  Google Scholar 

  10. Choueka, Y.: Finite automata, definable sets, and regular expressions over ω n-tapes. J. Computer and System Sciences 17(1), 81–97 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  11. Cohen, R.S., Gold, A.Y.: Theory of ω-languages, parts one and two. J. Computer and System Sciences 15, 169–208 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  12. Courcelle, B.: Frontiers of infinite trees. Theoretical Informatics and Applications 12, 319–337 (1978)

    MathSciNet  MATH  Google Scholar 

  13. Ésik, Z., Iván, S.: Operational characterization of scattered MCFLs. arXiv:1304.6388 [cs.FL]

    Google Scholar 

  14. Ésik, Z., Iván, S.: Büchi context-free languages. Theoretical Computer Science 412, 805–821 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  15. Ésik, Z., Iván, S.: On Muller context-free grammars. Theoretical Computer Science 416, 17–32 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  16. Ésik, Z., Iván, S.: Hausdorff rank of scattered context-free linear orders. In: Fernández-Baca, D. (ed.) LATIN 2012. LNCS, vol. 7256, pp. 291–302. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  17. Ésik, Z., Okawa, S.: On context-free languages of scattered words. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol. 7410, pp. 142–153. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  18. Khoussainov, B., Rubin, S., Stephan, F.: Automatic linear orders and trees. ACM Transactions on Computational Logic (TOCL) 6, 675–700 (2005)

    Article  MathSciNet  Google Scholar 

  19. Muller, R.: Infinite sequences and finite machines. In: 4th Annual Symposium on Switching Circuit Theory and Logical Design, pp. 3–16. IEEE Computer Society (1963)

    Google Scholar 

  20. Nivat, M.: Sur les ensembles de mots infinis engendrés par une grammaire algébrique (French). Theoretical Informatics and Applications 12, 259–278 (1978)

    MathSciNet  MATH  Google Scholar 

  21. Perrin, D., Pin, J.-E.: Infinite Words. Elsevier (2004)

    Google Scholar 

  22. Rosenstein, J.G.: Linear Orderings. Academic Press (1982)

    Google Scholar 

  23. Wojciechowski, J.: Classes of transfinite sequences accepted by finite automata. Fundamenta Informaticae 7, 191–223 (1984)

    MathSciNet  MATH  Google Scholar 

  24. Wojciechowski, J.: Finite automata on transfinite sequences and regular expressions. Fundamenta Informaticae 8, 379–396 (1985)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Szeged, Hungary

    Zoltán Ésik & Szabolcs Iván

Authors
  1. Zoltán Ésik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Szabolcs Iván
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LIGM, University Paris-Est Marne-la-Vallée, 5 Bd Descartes, Champs-sur-Marne, 77454, Marne-la-Vallée Cedex 2, France

    Marie-Pierre Béal

  2. LIAFA, UMR 7089, University Paris Diderot, 75205, Paris cedex 13, France

    Olivier Carton

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ésik, Z., Iván, S. (2013). Operational Characterization of Scattered MCFLs. In: Béal, MP., Carton, O. (eds) Developments in Language Theory. DLT 2013. Lecture Notes in Computer Science, vol 7907. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38771-5_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38771-5_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38770-8

  • Online ISBN: 978-3-642-38771-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation