Skip to main content
SpringerLink
Log in

Approximation to the Smallest Regular Expression for a Given Regular Language

  • Conference paper
Implementation and Application of Automata (CIAA 2004)

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

Included in the following conference series:

Abstract

A regular expression that represents the language accepted by a given finite automaton can be obtained using the the state elimination algorithm. The order of vertex removal affects the size of the resulting expression. We use here an heuristic to compute an approximation to the order of vertex removal that leads to the smallest regular expression obtainable this way.

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

References

  1. Delgado, M.: Computing commutative images of rational languages and applications. Theor. Inform. Appl. 35, 419–435 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  2. Delgado, M., Fernandes, V.H.: Abelian kernels of some monoids of injective partial transformations and an application. Semigroup Forum 61, 435–452 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  3. Delgado, M., Linton, S., Morais, J.: Automata: A GAP [4] package (accepted), http://www.fc.up.pt/cmup/mdelgado/automata

  4. The GAP Group: GAP – Groups, Algorithms, and Programming. Version 4.4 (2004), http://www.gap-system.org

Download references

Author information

Authors and Affiliations

  1. Departamento de Matemática e CMUP, Universidade do Porto, Rua do Campo Alegre, 687, 4169-007, Porto, Portugal

    Manuel Delgado & José Morais

Authors
  1. Manuel Delgado
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. José Morais
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Manitoba, R3T 2N2, Winnipeg, MB, Canada

    Michael Domaratzki

  2. Department of Mathematics, University of Turku, Finland

    Alexander Okhotin

  3. School of Computing, Queen’s University, K7L 3N6, Kingston, Ontario, Canada

    Kai Salomaa

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

    Sheng Yu

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Delgado, M., Morais, J. (2005). Approximation to the Smallest Regular Expression for a Given Regular Language. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds) Implementation and Application of Automata. CIAA 2004. Lecture Notes in Computer Science, vol 3317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30500-2_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30500-2_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24318-2

  • Online ISBN: 978-3-540-30500-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation