Skip to main content
Springer Nature Link
Log in

FA Minimisation Heuristics for a Class of Finite Languages

  • Conference paper
  • First Online:
Automata Implementation (WIA 1999)

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

Included in the following conference series:

  • 380 Accesses

Abstract

In this paper, we deal with minimization of finite automata associated with finite languages all the words have the same length. This problem arises in the context of Constraint Satisfaction Problems, widely used in AI. We first give some complexity results which are based on the strong relationship with covering problems of bipartite graphs. We then use these coverings as a basic tool for the definition of minimization heuristics, and describe some experimental results.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. J. Amilhastre, M. C. Vilarem, and P. Janssen. Complexity of minimum biclique cover and decomposition for bipartite domino-free graphs. Discrete Applied Mathematics, 86(2):125–144, September 1998.

    Article  MATH  MathSciNet  Google Scholar 

  2. R.E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C(35-6):677–691, 1986.

    Article  Google Scholar 

  3. J. Daciuk, W. Watson, and B.W. Watson. Incremental construction of minimal acyclic finite state automata and transducers. In Finite State Methods in Natural Language Processing, Ankara, Turkey, 1998.

    Google Scholar 

  4. P.C. Fishburn and P.L. Hammer. Bipartite dimensions and bipartite degrees of graphs. Technical Report 76, DIMACS, June 1993. available at http://dimacs.rutgers.edu/TechnicalReports.

  5. Tao Jiang and B. Ravikumar. Minimal NFA Problems are hard. SIAM Journal of Computation, 22:1117–1141, December 1993.

    Article  MATH  MathSciNet  Google Scholar 

  6. J. Kim. State minimization of nondeterministic machines. Technical report, IBM Thomas J. Watson Res. Center, 1974. RC 4896.

    Google Scholar 

  7. T. Kameda and P. Weiner. On the state minimization of nondeterministic finite automata. IEEE Trans. Comp., C(19):617–627, 1970.

    Article  MathSciNet  Google Scholar 

  8. U. Montanari. Networks of constraints: fundamental properties and applications to picture processing. Information Sciences, (7):95–132, 1974.

    Google Scholar 

  9. O. Matz and A. Potthoff. Computing small nondeterministic finite automata. In A. Skou U.H. Engberg, K.G. Larsen, editor, Workshop on Tools and Algorithms for the Construction and Analysis of Systems, pages 74–88. BRICS Notes Series, May 1995.

    Google Scholar 

  10. J. Orlin. Containment in graph theory: Covering graphs with cliques. Nederl. Akad. Wetensch. Indag. Math., 39:211–218, 1977.

    MathSciNet  Google Scholar 

  11. Dominique Revuz. Dictionnaires et Lexiques, méthodes et algorithmes. PhD thesis, Université Paris VII, Février 1991.

    Google Scholar 

  12. N. R. Vempaty. Solving constraint satisfaction problems using finite state automata. In American Association for Artificial Intelligence (AAAI’92), pages 453–458, San Jose, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d’Informatique de Robotique et de Microélectronique de Montpellier, UMR CNRS-Univ Montpellier II, IFA, 161 rue Ada, 34392, Montpellier cedex 5, France

    Jérôme Amilhastre, Philippe Janssen & Marie-Catherine Vilarem

Authors
  1. Jérôme Amilhastre
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philippe Janssen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marie-Catherine Vilarem
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universität Potsdam, Institut für Informatik, August-Bebel-Straße 89, 14482, Potsdam, Germany

    Oliver Boldt

  2. Institut für Informatik, Universität Potsdam, Potsdam

    Helmut Jürgensen

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

    Helmut Jürgensen

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Amilhastre, J., Janssen, P., Vilarem, MC. (2001). FA Minimisation Heuristics for a Class of Finite Languages. In: Boldt, O., Jürgensen, H. (eds) Automata Implementation. WIA 1999. Lecture Notes in Computer Science, vol 2214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45526-4_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-45526-4_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42812-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics