Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Finite-State Methods and Natural Language Processing

FSMNLP 2005: Finite-State Methods and Natural Language Processing pp 1–8Cite as

Characterizations of Regularity

  • Conference paper

  • 678 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4002))

Abstract

Regular languages have many different characterizations in terms of automata, congruences, semigroups etc. We have a look at some more recent results, obtained mostly during the last two decades, namely characterizations using morphic compositions, equality sets and well orderings.

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. Myhill, J.: Finite automata and the representation of events. Technical Report WADD TR-57-624, Wright Patterson Air Force Base, Ohio (1957)

    Google Scholar 

  2. Nerode, A.: Linear automaton transformations. Proc. Amer. Math. Soc. 9, 541–544 (1958)

    Article  MathSciNet  MATH  Google Scholar 

  3. Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM Journal 3, 115–125 (1959)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  5. McNaughton, R., Papert, S.: Counter-free automata. The M.I.T. Press, Cambridge, Mass.-London (1971); With an appendix by William Henneman, M.I.T. Research Monograph, No. 65

    Google Scholar 

  6. Büchi, J.R.: Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlagen Math. 6, 66–92 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  7. Elgot, C.C.: Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc. 98, 21–51 (1961)

    Article  MathSciNet  MATH  Google Scholar 

  8. Culik II, K., Fich, F., Salomaa, A.: A homomorphic characterization of regular languages. Discrete Appl. Math. 4, 149–152 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  9. Latteux, M., Leguy, J.: On the composition of morphisms and inverse morphisms. In: Díaz, J. (ed.) ICALP 1983. LNCS, vol. 154, pp. 420–432. Springer, Heidelberg (1983)

    Chapter  Google Scholar 

  10. Turakainen, P.: A machine-oriented approach to composition of morphisms and inverse morphisms. Bulletin of the EATCS 20, 162–166 (1983)

    Google Scholar 

  11. Karhumäki, J., Linna, M.: A note on morphic characterization of languages. Discrete Appl. Math. 5, 243–246 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  12. Latteux, M., Turakainen, P.: A new normal form for the compositions of morphisms and inverse morphisms. Math. Systems Theory 20, 261–271 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  13. Harju, T., Kleijn, H.C.M.: Decidability problems for unary output sequential transducers. Discrete Appl. Math. 32, 131–140 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  14. Choffrut, C., Karhumäki, J.: Test sets for morphisms with bounded delay. Discrete Appl. Math. 12, 93–101 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  15. Halava, V., Harju, T., Latteux, M.: Representation of regular languages by equality sets. Bulletin of the EATCS 86, 224–228 (2005)

    MathSciNet  MATH  Google Scholar 

  16. Halava, V., Harju, T., Latteux, M.: Equality sets of prefix morphisms and regular star languages. Inf. Process. Lett. 94, 151–154 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  17. Higman, G.: Ordering by divisibility in abstract algebras. Proc. London Math. 3 (1952)

    Google Scholar 

  18. Ehrenfeucht, A., Haussler, D., Rozenberg, G.: On regularity of context-free languages. Theoret. Comput. Sci. 27, 311–332 (1983)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Turku, Finland

    Tero Harju

Authors
  1. Tero Harju
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Language Research Service, CSC Scientific Computing Ltd., Finland

    Anssi Yli-Jyrä

  2. Palo Alto Research Center, Stanford University, P.O. Box, USA

    Lauri Karttunen

  3. Department of Mathematics and Turku Centre for Computer Science TUCS, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Harju, T. (2006). Characterizations of Regularity. In: Yli-Jyrä, A., Karttunen, L., Karhumäki, J. (eds) Finite-State Methods and Natural Language Processing. FSMNLP 2005. Lecture Notes in Computer Science(), vol 4002. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780885_1

Download citation

  • DOI: https://doi.org/10.1007/11780885_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35467-3

  • Online ISBN: 978-3-540-35469-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation