Skip to main content
SpringerLink
Log in

Factorizations and Universal Automaton of Omega Languages

  • Conference paper
Book cover 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:

  • 752 Accesses

Abstract

In this paper, we extend the concept of factorization on finite words to ω-rational languages and show how to compute them. We define a normal form for Büchi automata and introduce a universal automaton for Büchi automata in normal form. We prove that, for every ω-rational language, this Büchi automaton, based on factorization, is canonical and that it is the smallest automaton that contains the morphic image of every equivalent Büchi automaton in normal form.

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. Carton, O., Michel, M.: Unambiguous Büchi automata. Theoret. Comput. Sci. 297, 37–81 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  2. Conway, J.H.: Regular algebra and finite machines. Mathematics series. Chapman and Hall, London (1971)

    MATH  Google Scholar 

  3. Lombardy, S.: On the construction of reversible automata for reversible languages. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 170–182. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Lombardy, S., Sakarovitch, J.: Star height of reversible languages and universal automata. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, pp. 76–90. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. Lombardy, S., Sakarovitch, J.: The universal automaton. In Logic and Automata. Texts in Logic and Games, vol. 2, pp. 457–504. Amsterdam University Press (2008)

    Google Scholar 

  6. Perrin, D., Pin, J.-É.: Semigroups and automata on infinite words. In: Semigroups, Formal Languages and Groups, pp. 49–72. Kluwer Academic Publishers (1995)

    Google Scholar 

  7. Perrin, D., Pin, J.-É.: Infinite Words. Pure and Applied Mathematics, vol. 141. Elsevier (2004)

    Google Scholar 

  8. Polák, L.: Minimalizations of nfa using the universal automaton. Int. J. Found. Comput. Sci. 16(5), 999–1010 (2005)

    Article  MATH  Google Scholar 

  9. Sakarovitch, J. Elements of Automata Theory. Cambridge University Press (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIGM, Université Paris-Est Marne-la-Vallée, France

    Vincent Carnino

  2. LABRI, Université de Bordeaux - IPB, France

    Sylvain Lombardy

Authors
  1. Vincent Carnino
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sylvain Lombardy
    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

Carnino, V., Lombardy, S. (2013). Factorizations and Universal Automaton of Omega Languages. 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_30

Download citation

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

  • 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