The complexity of restricted regular expressions and the synthesis problem for finite automata
- 31 December 1981
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 23 (3) , 348-354
- https://doi.org/10.1016/0022-0000(81)90070-2
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Automatic generation of efficient lexical processors using finite state techniquesCommunications of the ACM, 1968
- Programming Techniques: Regular expression search algorithmCommunications of the ACM, 1968