Skip to main content
Springer Nature Link
Log in

LANGAGE: A Maple package for automaton characterization of regular languages

  • Contributed Papers
  • Conference paper
  • First Online:
Automata Implementation (WIA 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1436))

Included in the following conference series:

Abstract

LANGAGE is a set of procedures for deciding whether or not a language given by its minimal automaton is piecewise testable, locally testable, strictly locally testable, or strongly locally testable. New polynomial algorithms are implemented for the two last properties. This package is written using the symbolic computation system Maple. It works with AG, a set of Maple packages for processing automata and finite semigroups.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Beauquier, J. Berstel, and P. Chrétienne. Éléments d'algorithmique. Masson, Paris, 1992.

    Google Scholar 

  2. D. Beauquier and J.-E. Pin. Scanners and languages. Theoret. Comput. Sci., 84:3–21, 1991.

    Google Scholar 

  3. J. A. Brzozowski and I. Simon. Characterization of locally testable events. Discrete Math., 4:243–271, 1973.

    Google Scholar 

  4. P. Caron. AG: A set of Maple packages for manipulating automata and finite semigroups. Software-Practice & Experience, 27(8):863–884, 1997.

    Google Scholar 

  5. P. Caron. Families of locally testable languages. Rapport LIR 97.03, Université de Rouen, France, 1997.

    Google Scholar 

  6. S. M. Kim, R. McNaughton, and R. McCloskey. A polynomial time algorithm for the local testability problem of deterministic finite automata. IEEE Trans. Comput., 40(10):1087–1093, 1991.

    Google Scholar 

  7. R. McNaughton. Algebraic decision procedures for local testability. Math. Systems Theory, 8:60–76, 1974.

    Google Scholar 

  8. R. McNaughton and S. Papert. Counter free automata. M.I.T. Press, Cambridge, 1971.

    Google Scholar 

  9. M.-P. Schützenberger. On finite monoids having only trivial subgroups. Inform. and Control, 8:190–194, 1965.

    Google Scholar 

  10. I. Simon. Piecewise testable events. In Proceedings of the 2nd GI conf., number 33 in Lecture Notes in Computer Science, pages 214–222. Springer-Verlag, Berlin, 1975.

    Google Scholar 

  11. J. Stern. Complexity of some problems from the theory of automata. Inform. and Control, 66:163–176, 1985.

    Google Scholar 

  12. Y. Zalcstein. Locally testable languages. J. Comput. System Sci., 6:151–167, 1972.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Informatique de Rouen, Université de Rouen, 76821, Mont-Saint Aignan, Cédex

    Pascal Caron

Authors
  1. Pascal Caron
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Derick Wood Sheng Yu

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Caron, P. (1998). LANGAGE: A Maple package for automaton characterization of regular languages. In: Wood, D., Yu, S. (eds) Automata Implementation. WIA 1997. Lecture Notes in Computer Science, vol 1436. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031380

Download citation

  • DOI: https://doi.org/10.1007/BFb0031380

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64694-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics