skip to main content
article
Free access

Constructing a finite automaton for a given regular expression

Published: 01 September 1980 Publication History
First page of PDF

References

[1]
Aho, A. V., Hopcroft, J. E., Ullman, J. D. The Design and Analysis of Computer Algorithms, Addison-Wesley (1974).
[2]
Aho, A. V., Ullman, J. D. The Theory of Parsing, Translation, and Compiling, Vol. I, Prentice Hall (1972).
[3]
Aho, A. V., Ullman, J. D. Principles of Compiler Design, Addison-Wesley (1977).
[4]
Ginzburg, A. Algebraic Theory of Automata, Academic Press (1968).
[5]
Johnson, W., Porter, J., Ackley, S., Ross, D. Automatic Generation of Efficient Lexical Processors Using Finite State Techniques, CACM 11:12, 805--813 (1968).
[6]
Leiss, E. REGPACK, an Interactive Package for Regular Languages and Finite Antomata, Research Report CS-77-32, Department of Computer Science, University of Waterloo, October 1977.
[7]
Leiss, E. On the Complexity of Restricted Regular Expressions, Research Report 78/01/A, Departamento de Ciencias de la Computación, Universidad de Chile, July 1978.
[8]
McNaughton, R., Yamada, H. Regular expressions and state graphs for automata, in Sequential Machines: Selected Papers, (E. F. Moore, ed.), 157--174, Addison-Wesley (1964).
[9]
Mirkin, B. G. An algorithm for constructing a base in a language of regular expressions (in Russian), Iz. Akad, Nauk SSSR, Techn. Kibernet. No. 5, 113--119 (1966), Engl. translation in Engineering cybernetics, No. 5, 110--116 (1966).
[10]
Thompson, K. Regular expression search algorithm, CACM 11:6, 419--422 (1968).

Cited By

View all
  • (2015)Accelerating DFA Construction by Parallelizing Subset ConstructionTrustworthy Computing and Services10.1007/978-3-662-47401-3_3(16-24)Online publication date: 20-Jun-2015
  • (2013)Non-blocking parallel subset construction on shared-memory multicore architecturesProceedings of the Eleventh Australasian Symposium on Parallel and Distributed Computing - Volume 14010.5555/2525512.2525514(13-20)Online publication date: 29-Jan-2013
  • (2012)ON THE AVERAGE SIZE OF GLUSHKOV AND PARTIAL DERIVATIVE AUTOMATAInternational Journal of Foundations of Computer Science10.1142/S012905411240040023:05(969-984)Online publication date: Aug-2012
  • Show More Cited By
  1. Constructing a finite automaton for a given regular expression

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM SIGACT News
    ACM SIGACT News  Volume 12, Issue 3
    Fall 1980
    65 pages
    ISSN:0163-5700
    DOI:10.1145/1008861
    Issue’s Table of Contents

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 01 September 1980
    Published in SIGACT Volume 12, Issue 3

    Check for updates

    Qualifiers

    • Article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)51
    • Downloads (Last 6 weeks)10
    Reflects downloads up to 19 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2015)Accelerating DFA Construction by Parallelizing Subset ConstructionTrustworthy Computing and Services10.1007/978-3-662-47401-3_3(16-24)Online publication date: 20-Jun-2015
    • (2013)Non-blocking parallel subset construction on shared-memory multicore architecturesProceedings of the Eleventh Australasian Symposium on Parallel and Distributed Computing - Volume 14010.5555/2525512.2525514(13-20)Online publication date: 29-Jan-2013
    • (2012)ON THE AVERAGE SIZE OF GLUSHKOV AND PARTIAL DERIVATIVE AUTOMATAInternational Journal of Foundations of Computer Science10.1142/S012905411240040023:05(969-984)Online publication date: Aug-2012
    • (2011)The average transition complexity of Glushkov and partial derivative automataProceedings of the 15th international conference on Developments in language theory10.5555/2032178.2032189(93-104)Online publication date: 19-Jul-2011
    • (2011)Partial derivatives of an extended regular expressionProceedings of the 5th international conference on Language and automata theory and applications10.5555/2022896.2022911(179-191)Online publication date: 26-May-2011
    • (2011)Accelerating DFA Construction by Hierarchical MergingProceedings of the 2011 IEEE Ninth International Symposium on Parallel and Distributed Processing with Applications10.1109/ISPA.2011.32(1-6)Online publication date: 26-May-2011
    • (2011)The Average Transition Complexity of Glushkov and Partial Derivative AutomataDevelopments in Language Theory10.1007/978-3-642-22321-1_9(93-104)Online publication date: 2011
    • (2011)Partial Derivatives of an Extended Regular ExpressionLanguage and Automata Theory and Applications10.1007/978-3-642-21254-3_13(179-191)Online publication date: 2011
    • (2007)FIRE/J—optimizing regular expression searches with generative programmingSoftware: Practice and Experience10.1002/spe.84138:6(557-573)Online publication date: 23-Jul-2007
    • (2005)Regular expressionsJournal of Automata, Languages and Combinatorics10.5555/1375928.137593010:4(407-437)Online publication date: 1-Apr-2005

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Login options

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media