Skip to main content
SpringerLink
Log in

Characterization of Star-Connected Languages Using Finite Automata

  • Conference paper
Language and Automata Theory and Applications (LATA 2008)

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

  • 802 Accesses

Abstract

In this paper we characterize star-connected languages using finite automata: any language is star-connected if and only if it is accepted by a finite automaton with cycles which are proper compositions of connected cycles. Star-connected (flat) languages play an important role in the theory of recognizable languages of monoids with partial commutations. In addition we introduce a flat counterpart of concurrent star operation used in the theory of recognizable languages.

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. Clerbout, M., Latteux, M.: Semi-commutations. Information & Computation 73, 59–74 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  2. Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995)

    Google Scholar 

  3. Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (2001)

    MATH  Google Scholar 

  4. Klunder, B.: Star-Connected Flat Languages and Automata. Fundamenta Informaticae 72(1-3), 235–243 (2006)

    MATH  MathSciNet  Google Scholar 

  5. Klunder, B., Ochmański, E., Stawikowska, K.: On Star-Connected Flat Languages. Fundamenta Informaticae 67(1-3), 93–105 (2005)

    MATH  MathSciNet  Google Scholar 

  6. Mazurkiewicz, A.: Concurrent Program Schemes and Their Interpretations. Report DAIMI-PB-78, Aarhus University (1977)

    Google Scholar 

  7. Ochmański, E.: Regular Behaviour of Concurrent Systems. Bulletin of EATCS 27, 56–67 (1985)

    Google Scholar 

  8. Ochmański, E.: Recognizable Trace Languages. In: [2], pp. 167–204. World Scientific, Singapore (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, Toruń, Poland

    Barbara Klunder

Authors
  1. Barbara Klunder
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Rovira i Virgili University, Plaza Imperial Tàrraco 1, 43005, Tarragona, Spain

    Carlos Martín-Vide

  2. Fachbereich Elektrotechnik/Informatik, Universität Kassel, Wilhelmshöher Allee 73, 34121, Kassel, Germany

    Friedrich Otto

  3. Fachbereich 4, Abteilung Informatik/Wirtschaftsinformatik, Universität Trier, Campus II, Gebäude H, 54286, Trier, Germany

    Henning Fernau

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Klunder, B. (2008). Characterization of Star-Connected Languages Using Finite Automata. In: Martín-Vide, C., Otto, F., Fernau, H. (eds) Language and Automata Theory and Applications. LATA 2008. Lecture Notes in Computer Science, vol 5196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88282-4_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88282-4_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88281-7

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation