One-Unambiguous Regular Languages
- 1 May 1998
- journal article
- Published by Elsevier in Information and Computation
- Vol. 142 (2), 182-206
- https://doi.org/10.1006/inco.1997.2695
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- From regular expressions to DFA's using compressed NFA'sTheoretical Computer Science, 1997
- Local languages and the Berry-Sethi algorithmTheoretical Computer Science, 1996
- Regular expressions into finite automataTheoretical Computer Science, 1993
- From regular expressions to deterministic automataTheoretical Computer Science, 1986
- Amounts of nondeterminism in finite automataActa Informatica, 1980
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- Ambiguity in Graphs and ExpressionsIEEE Transactions on Computers, 1971
- Bracketed context-free languagesJournal of Computer and System Sciences, 1967
- Derivatives of Regular ExpressionsJournal of the ACM, 1964
- THE ABSTRACT THEORY OF AUTOMATARussian Mathematical Surveys, 1961