Skip to main content
SpringerLink
Log in

Determinization of Glushkov Automata

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

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

Included in the following conference series:

Abstract

We establish a new upper bound on the number of states of the automaton yielded by the determinization of a Glushkov automaton. We show that the ZPC structure, which is an implicit construction for Glushkov automata, leads to an efficient implementation of the subset construction.

This work is a contribution to the Automate software development project carried on by A.I.A. Working Group (Algorithmics and Implementation of Automata), L.I.F.A.R. Contact: {Champarnaud, Ziadi}@dir.univ-rouen.fr.

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. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The design and analysis of computer algorithms. Addison-Wesley, Reading, MA, 1974.

    MATH  Google Scholar 

  2. V. Antimirov. Partial derivatives of regular expressions and finite automaton constructions. Theoret. Comput. Sci., 155:291–319, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  3. P. Caron and D. Ziadi. Characterization of Glushkov automata. Theoret. Comput. Sci. to appear.

    Google Scholar 

  4. J.-M. Champarnaud and G. Hansel. Automate, a computing package for automata and finite semigroups. J. Symbolic Comput., 12:197–220, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  5. M.D. Davis, R. Sigal, and E.J. Weyuker. Computability, Complexity, and Languages, Fundamentals of Theoretical Computer Science. Academic Press, 1994.

    Google Scholar 

  6. V. M. Glushkov. The abstract theory of automata. Russian Mathematical Surveys, 16:1–53, 1961.

    Article  Google Scholar 

  7. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, MA, 1979.

    MATH  Google Scholar 

  8. J. H. Johnson. A program for computing finite automata. Unpublished Report, University of Waterloo, Canada, 1986.

    Google Scholar 

  9. J. H. Johnson and D. Wood. Instruction computation in subset construction. In D. Raymond, D. Wood, and S. Yu, editors, Automata Implementation: First International Workshop on Implementing Automata, WIA’96, number 1260 in Lecture Notes in Computer Science, pages 64–71, London, Ontario, 1997. Springer-Verlag, Berlin.

    Google Scholar 

  10. S. Kleene. Representation of events in nerve nets and finite automata. Automata Studies, Ann. Math. Studies 34:3–41, 1956. Princeton U. Press.

    MathSciNet  Google Scholar 

  11. T. K. S. Leslie. Efficient approaches to subset construction. Technical Report CS-92-29, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada, 1992.

    Google Scholar 

  12. T. K. S. Leslie, D. R. Raymond, and D. Wood. The expected performance of subset construction. non publié, 1996.

    Google Scholar 

  13. D. Perrin. Finite automata. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Formal Models and Semantics, volume B, pages 1–57. Elsevier, Amsterdam, 1990.

    Google Scholar 

  14. J.-L. Ponty. An efficient null-free procedure for deciding regular language membership. In D. Wood and S. Yu, editors, Automata Implementation: Second International Workshop on Implementing Automata, WIA’97, number 1436 in Lecture Notes in Computer Science, pages 159–170, London, Ontario, 1998. Springer-Verlag, Berlin.

    Google Scholar 

  15. J.-L. Ponty, D. Ziadi, and J.-M. Champarnaud. A new quadratic algorithm to convert a regular expression into an automaton. In D. Raymond, D. Wood, and S. Yu, editors, Automata Implementation: First International Workshop on Implementing Automata, WIA’96, number 1260 in Lecture Notes in Computer Science, pages 109–119, London, Ontario, 1997. Springer-Verlag, Berlin.

    Google Scholar 

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

    MathSciNet  Google Scholar 

  17. D. Raymond and D. Wood. Grail, a C++ library for automata and expressions. J. Symbolic Comput., 17:341–350, 1994.

    Article  MATH  Google Scholar 

  18. D. Wood. Theory of Computation. Wiley, New York, 1987.

    MATH  Google Scholar 

  19. S. Yu. Regular languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume I, Word, Language, Grammar, pages 41–110. Springer-Verlag, Berlin, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIFAR Université de Rouen, Mont-Saint-Aignan Cedex, 76821, France

    Jean-Marc Champarnaud, Djelloul Ziadi & Jean-Luc Ponty

Authors
  1. Jean-Marc Champarnaud
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Djelloul Ziadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jean-Luc Ponty
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Laboratory, University of Rouen, F-76821, Mont-Saint-Aignan Cedex, France

    Jean-Marc Champarnaud  & Djelloul Ziadi  & 

  2. LI/E3i University of Tours, 64 avenue Jean Portalis, F-37200, Tours, France

    Denis Maurel

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Champarnaud, JM., Ziadi, D., Ponty, JL. (1999). Determinization of Glushkov Automata. In: Champarnaud, JM., Ziadi, D., Maurel, D. (eds) Automata Implementation. WIA 1998. Lecture Notes in Computer Science, vol 1660. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48057-9_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-48057-9_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48057-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation