An automata-based recognition algorithm for semi-extended regular expressions

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

Volumn 1893, Issue , 2000, Pages 699-708

  Yamamoto, Hiroaki ^a  

^a SHINSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; FINITE AUTOMATA; PATTERN MATCHING;

EXTENDED REGULAR EXPRESSIONS; INPUT STRING; NONDETERMINISTIC FINITE AUTOMATON; RECOGNITION ALGORITHM; REGULAR EXPRESSIONS;

DYNAMIC PROGRAMMING;

EID: 84959200157     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44612-5_65     Document Type: Conference Paper

References (10)

1. A.V. Aho, Algorithms for finding patterns in strings, In J.V. Leeuwen, ed. Handbook of theoretical computer science, Elsevier Science Pub., 1990.
2. A.K. Chandra, D.C. Kozen and L.J. Stockmeyer, Alternation, J. Assoc. Comput. Mach. 28,1, 114-133, 1981.
3. C.H. Chang, and R. Paige, From regular expressions to DFA's using compressed NFA's, Theoret. Comput. Sci., 178, 1-36, 1997.
4. J.R. Knight and E.W. Myers, Super-Pattern matching, Algorithmica, 13, 1-2, 211-243, 1995.
5. J. Dassow, J. Hromkovic, J. Karhuaki, B. Rovan and A. Slobodova, On the power of synchronization in parallel computation, In Proc. 14th MFCS'89, LNCS 379,196-206, 1989.
6. J.E. Hopcroft and J.D. Ullman, Introduction to automata theory language and computation, Addison Wesley, Reading Mass, 1979.
7. J. Hromkovic, K. Inoue, B. Rovan, A. Slobodova, I. Takanami and K.W. Wagner, On the power of one-way synchronized alternating machines with small space, International Journal of Foundations of Computer Science, 3, 1, 65-79, 1992.
8. G. Myers, A four Russians algorithm for regular expression pattern matching, J. Assoc. Comput. Mach. 39,4, 430-448, 1992.
9. A. Slobodova, On the power of communication in alternating machines, In Proc. 13th MFCS'88, LNCS 324,518-528, 1988.
10. H. Yamamoto, On the power of input-synchronized alternating finite automata, Proc. COCOON'2000, LNCS, to appear.