Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Descriptional Complexity of Formal Systems

DCFS 2014: Descriptional Complexity of Formal Systems pp 23–28Cite as

Star-Free Languages and Local Divisors

  • Conference paper

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

Abstract

A celebrated result of Schützenberger says that a language is star-free if and only if it is is recognized by a finite aperiodic monoid. We give a new proof for this theorem using local divisors.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Diekert, V., Gastin, P.: Pure future local temporal logics are expressively complete for Mazurkiewicz traces. Information and Computation 204, 1597–1619 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  2. Fernández López, A., Tocón Barroso, M.: The local algebras of an associative algebra and their applications. In: Misra, J. (ed.) Applicable Mathematics in the Golden Age, pp. 254–275. Narosa (2002)

    Google Scholar 

  3. Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies. Annals of Mathematics Studies, vol. 34, pp. 3–40. Princeton University Press (1956)

    Google Scholar 

  4. Meyberg, K.: Lectures on algebras and triple systems. Technical report, University of Virginia, Charlottesville (1972)

    Google Scholar 

  5. Pin, J.-É.: Varieties of Formal Languages. North Oxford Academic, London (1986)

    Book  MATH  Google Scholar 

  6. Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM Journal of Research and Development 3, 114–125 (1959); Reprinted in Moore, E.F. (ed.) Sequential Machines: Selected Papers. Addison-Wesley (1964)

    Google Scholar 

  7. Schützenberger, M.P.: On finite monoids having only trivial subgroups. Information and Control 8, 190–194 (1965)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FMI, University of Stuttgart, Germany

    Manfred Kufleitner

Authors
  1. Manfred Kufleitner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, The University of Western Ontario, N6A 5B7, London, Ontario, Canada

    Helmut Jürgensen

  2. Department of Mathematics and TUCS, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki

  3. University of Turku, Fi-20014, Turku, Finland

    Alexander Okhotin

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Kufleitner, M. (2014). Star-Free Languages and Local Divisors. In: Jürgensen, H., Karhumäki, J., Okhotin, A. (eds) Descriptional Complexity of Formal Systems. DCFS 2014. Lecture Notes in Computer Science, vol 8614. Springer, Cham. https://doi.org/10.1007/978-3-319-09704-6_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09704-6_3

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09703-9

  • Online ISBN: 978-3-319-09704-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation