The Complexity of Regular(-Like) Expressions
Authors:
- 1 January 2010
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 16-30
Abstract
No abstract availableKeywords
This publication has 41 references indexed in Scilit:
- Regular Expression Matching with Multi-Strings and Intervals2010
- NORMALIZED EXPRESSIONS AND FINITE AUTOMATAInternational Journal of Algebra and Computation, 2007
- A Unified Construction of the Glushkov, Follow, and Antimirov AutomataLecture Notes in Computer Science, 2006
- Partial derivatives of regular expressions and finite automaton constructionsTheoretical Computer Science, 1996
- Regular expressions into finite automataTheoretical Computer Science, 1993
- Efficient simulation of finite automata by neural netsJournal of the ACM, 1991
- From regular expressions to deterministic automataTheoretical Computer Science, 1986
- Derivatives of Regular ExpressionsJournal of the ACM, 1964
- Transition graphs and the star-height of regular events.The Michigan Mathematical Journal, 1963
- Signal Flow Graph Techniques for Sequential Circuit State DiagramsIEEE Transactions on Electronic Computers, 1963