From regular expressions to deterministic automata
作者： Gerard Berry , Ravi Sethi
DOI: 10.1016/0304-3975(86)90088-5
关键词:
摘要: … We study two well-known algorithms for constructing a finite automaton from a regular expression. … We write L(A) for the language accepted by automaton A. A structural induction on E …
elsevier.com
acm.org 
core.ac.uk 
sci-hub.se 参考文章(12)
Thierry Despeyroux, Dominique Clement, Gilles Kahn, Laurent Hascoet, Joelle Despeyroux, Natural semantics on the computer INRIA. ,(1984)
Ravi Sethi, Jeffrey D. Ullman, Alfred V. Aho, Compilers: Principles, Techniques, and Tools ,(1986)
Alfred V. Aho, Pattern Matching in Strings Formal Language Theory#R##N#Perspectives and Open Problems. pp. 325- 347 ,(1980) , 10.1016/B978-0-12-115350-2.50016-6
Gérard Berry, Laurent Cosserat, The ESTEREL Synchronous Programming Language and its Mathematical Semantics international conference on concurrency theory. pp. 389- 448 ,(1984) , 10.1007/3-540-15670-4_19
Gregor V. Bochmann, Communication protocols and error recovery procedures ACM SIGOPS Operating Systems Review. ,vol. 9, pp. 45- 50 ,(1975) , 10.1145/563905.810898
M. O. Rabin, D. Scott, Finite automata and their decision problems Ibm Journal of Research and Development. ,vol. 3, pp. 114- 125 ,(1959) , 10.1147/RD.32.0114
Ken Thompson, None, Programming Techniques: Regular expression search algorithm Communications of The ACM. ,vol. 11, pp. 419- 422 ,(1968) , 10.1145/363347.363387
R. McNaughton, H. Yamada, Regular Expressions and State Graphs for Automata Ire Transactions on Electronic Computers. ,vol. 9, pp. 39- 47 ,(1960) , 10.1109/TEC.1960.5221603
Janusz A. Brzozowski, Derivatives of Regular Expressions Journal of the ACM. ,vol. 11, pp. 481- 494 ,(1964) , 10.1145/321239.321249
Robin Milner, A complete inference system for a class of regular behaviours Journal of Computer and System Sciences. ,vol. 28, pp. 439- 466 ,(1984) , 10.1016/0022-0000(84)90023-0