Partial derivatives of regular expressions and finite automata constructions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 900, Issue , 1995, Pages 455-466

  Antimirov, Valentin ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE AUTOMATA; PATTERN MATCHING; PIPELINE PROCESSING SYSTEMS;

PARTIAL DERIVATIVES; PROTOTYPE IMPLEMENTATIONS; REGULAR EXPRESSIONS; S-ALGORITHMS;

DATA HANDLING;

EID: 84947726782     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-59042-0_96     Document Type: Conference Paper

References (20)

1. V. M. Antimirov. Partial derivatives of regular expressions and finite automata constructions. Technical report, CRIN, 1994. (Forthcoming).
2. V. M. Antimirov and P. D. Mosses. Rewriting extended regular expressions (short version). In G. Rozenberg and A. Salomaa, editors, Developments in Language Theory - At the Crossroads of Mathematics, Computer Science and Biology, pages 195-209. World Scientific, Singapore, 1994.
3. V. M. Antimirov and P. D. Mosses. Rewriting extended regular expressions. Theoretical Comput. Sei., 141, 1995. (To appear).
4. G. Berry and R. Sethi.: From regular expressions to deterministic automata. Theoretical Comput. Sei., 48:117-126, 1986.
5. J. A. Brzozowski. Derivatives of regular expressions. J. ACM, 11:481-494, 1964.
6. J. A. Brzozowski and E. L. Leiss. On equations for regular languages, finite automata, and sequential networks. Theoretical Comput. Sci., 10:19-35, 1980.
7. C.-H. Chang and R. Paige. From regular expressions to DFA's using compressed NFA's. In A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, editors, Combinatorial Pattern Matching. Proceedings., volume 644 of Lecture Notes in Computer Science, pages 88-108. Springer-Verlag, 1992.
8. J. H. Conway. Regular Algebra and Finite Machines. Chapman and Hall, 1971.
9. A. Ginzburg. A procedure for checking equality of regular expressions. J. A CM, 14(2):355-362, 1967.
10. J. A. Goguen and J. Meseguer. Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoretical Comput. Sci., 105:217-273, 1992.
11. J. A. Goguen and T. Winkler. Introducing OBJ 3. Technical Report SRI-CSL-88- 9, Computer Science Lab., SRI International, 1988.
12. D. Krob. Differentiation of K-rational expressions. International Journal of Algebra and Computation, 2(1):57-87, 1992.
13. G. Kucherov and M. Rusinowitch. On Ground-Reducibility Problem for Word Rewriting Systems with Variables. In E. Deaton and R. Wilkerson, editors, Proceedings 1993 A CM/SIGAPP Symposium on Applied Computing, Phoenix (USA), Mar. 1994. ACM-Press.
14. R. McNaughton and H. Yamada. Regular expressions and state graphs for automata. IEEE Trans. on Electronic Computers, 9(1):39-47, 1960.
15. Y. Mizoguchi, H. Ohtsuka, and Y. Kawahara. A symbolic calculus of regular expressions. Bulletin of lnformatics and Cybernetics, 22(3-4):165-170, 1987.
16. D. Perrin. Finite automata. In J. van Leeuwen, A. Meyer, M. Nivat, M. Paterson, and D. Perrin, editors, Handbook of Theoretical Computer Science, volume B, chapter 1. Elsevier Science Publishers, Amsterdam; and MIT Press, 1990.
17. M. O. Rabin and D. Scott. Finite automata and their decision problems. IBM Journal of Research and Development, 3(2):114-125, Apr. 1959.
18. A. Salomaa. Theory of Automata. Pergamon, 1969.
19. K. Thompson. Regular expression search algorithms. Communication ACM, 11(6):419-422, 1968.
20. B. W. Watson. A taxonomy of finite automata construction algorithms. Computing Science Note 93/43, Eindhoven University of Technology, The Netherlands, 1993.