J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979

Keywords

Automaton, Computation, Computer science, Natural language processing, Programming language

References

No references recorded for this paper.

Cited by

• Series Parallel Digraphs with LoopsStefan Gulan — 2013
• High-Performance XML Filtering: An Overview of YFilterYanlei Diao, Michael J. Franklin — 2003
• Decidability of code propertiesHenning Fernau, Klaus Reinhardt, Ludwig Staiger — 2000
• Performance Evaluation via Perturbation AnalysisTarek Sobh — 1991
• Redundancy Removal during High-Level Synthesis Using Scheduling Don‘t-CaresWayne Wolf — 1997
• Advancements in Text Mining Algorithms and SoftwareSvetlana Y. Mironova, Michael W. Berry, Scott Atchley — 2003
• Yield-Languages Recognized by Alternating Tree RecognizersKai Salomaa — 1988
• Grammaires de graphes et langages formels. (Graph grammars and formal languages)Trong Hiêu Dinh — 2011
• The Logarithmic Alternation Hierarchiy Collapses: A Sigma^C_2 = A Pi^C_2Klaus-Jörn Lange, Birgit Jenner, Bernd Kirsig — 1987
• Use of 3D virtual environments in teaching astronomy and physicsRobert J. Lucas, U. Kolb — 2009
• Infinite Computations and a Hierarchy in Delta 3Branislav Rovan, Ľuboš Steskal — 2007
• A theoretical model of the Shapiro finite state automaton built on DNATadeusz Krasiński, Sebastian Sakowski — 2006
• Three families of maximally nondeterministic automataT Tom Verhoeff — 1987
• Efficient Methods for Automatic Speech RecognitionAlexander Seward — 2003
• An Efficient Probabilistic Algorithm for an Important NP Complete Problem in MathematicsCristian Dumitrescu — 2014
• Very Simple Models, the Self-Modifying Automata and Chain of Self-Modifying Automata, Can Explain Self-Referential Properties of Living BeingsJean-Paul Moulin — 1999
• An integrated environment of S/W specification and V&V for safety-critical systemsSeo Ryong Koo, Poong-Hyun Seong, Junbeom Yoo — 2004
• Generalized Queries on Probabilistic Context-Free GrammarsDavid V. Pynadath, Michael P. Wellman — 1996
• The Pseudovariety J is HyperdecidableJorge Almeida, Marc Zeitoun — 1997
• Parsing Beyond Context-Free GrammarsLaura Kallmeyer — 2010

Related papers

• Regular languagesSheng Yü — 1997
• Efficient string matchingAlfred V. Aho, Margaret J. Corasick — 1975
• Finite Automata and Their Decision ProblemsM. O. Rabin, D. Scott — 1959
• Computers and Intractability: A Guide to the Theory of NP-CompletenessM. R. Garey, David S. Johnson — 1979
• Introduction to Automata Theory, Languages and ComputationJ. Hopcroft, Rajeev Motwani, Rotwani — 1979
• Supervisory control of a class of discrete event processesPeter J. Ramadge, W.M. Wonham — 1987
• Language Identification in the LimitEric Gold — 1967
• The Design and Analysis of Computer AlgorithmsAlfred V. Aho, John E. Hopcroft — 1974
• Handbook of Formal LanguagesGrzegorz Rozenberg, Arto Salomaa — 1997