NFAs with tagged transitions, their conversion to deterministic automata and application to regular expressions

Proceedings - 7th International Symposium on String Processing and Information Retrieval, SPIRE 2000

Volumn , Issue , 2000, Pages 181-187

  Laurikari, V ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL METHODS; INFORMATION RETRIEVAL; PATTERN MATCHING; SEMANTICS;

CONSERVATIVE EXTENSIONS; DETERMINISTIC AUTOMATA; FORMAL SEMANTICS; INPUT STRING; KEEP TRACK OF; MEALY MACHINES; NONDETERMINISTIC FINITE AUTOMATON; REGULAR EXPRESSIONS;

NANOSTRUCTURED MATERIALS;

EID: 84964467051     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SPIRE.2000.878194     Document Type: Conference Paper

References (14)

1. A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley, 1986.
2. A. W. Appel. Modern Compiler Implementation in Java. Cambridge University Press, 1999.
3. R. A. Baeza-Yates and G. H. Gonnet. Efficient text searching of regular expressions. In G. Ausiello, M. Dezani-Ciancaglini, and S. R. D. Rocca, editors, Proceedings of the 16th International Colloquium on Automata, Languages and Programming, volume 372 of LNCS, pages 46-62, Berlin, July 1989. Springer.
4. R. A. Baeza-Yates and G. H. Gonnet. Fast text searching for regular expressions or automaton searching on tries. ACM, 43(6):915-936, Nov. 1996.
5. M. Lesk. Lex - a lexical analyzer generator. Technical Report 39, Bell Laboratories, Murray Hill, NJ, 1975.
6. H. R. Lewis and C. H. Papadimitrou. Elements of the Theory of Computation. Prentice Hall, 1981.
7. I. Nakata. Generation of pattern-matching algorithms by extended regular expressions. Advances in Software Science and Technology, 5:1-9, 1993.
8. I. Nakata and M. Sassa. Regular expressions with semantic rules and their application to data structure directed programs. Advances in Software Science and Technology, 3:93-108, 1991.
9. K. Oksanen. Real-time Garbage Collection of a Functional Persistent Heap. Licentiates Thesis, Helsinki University of Technology, Faculty of Information Technology, Department of Computer Science, 1999. Also available at http://hibase.cs.hut.fi/.
10. V. Paxson. Flex - Fast Lexical Analyzer Generator. Lawrence Berkeley Laboratory, Berkeley, California, 1995. ftp://ftp.ee.lbl.gov/flex-2.5.4.tar.gz.
11. S. Sippu and E. Soisalon-Soininen. Languages and Parsing, volume 1 of Parsing Theory, pages 65-113. Springer, 1988.
12. G. A. Stephen. String Searching Algorithms, volume 3 of Lecture Notes Series on Computing. World Scientific Publishing, 1994.
13. B. Watson. Implementing and using finite automata toolkits. Journal of Natural Language Engineering, 2(4):295-302, Dec. 1996.
14. B. Watson. A new regular grammar pattern matching algorithm. In J. Diaz and M. Serna, editors, Proceedings of the European Symposium on Algorithms, volume 1136 of Lecture Notes in Computer Science, pages 364-377, Berlin, Sept. 1996. Springer.