Fast parallel recognition of LR language suffixes
Information Processing Letters
Context-dependent nondeterminism for pushdown automata
Theoretical Computer Science
Finite turns and the regular closure of linear context-free languages
Discrete Applied Mathematics
On Extended Regular Expressions
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Regulated nondeterminism in pushdown automata
Theoretical Computer Science
Parsing with soft and hard constraints on dependency length
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Fast parallel recognition of LR language suffixes
Information Processing Letters
Regulated nondeterminism in pushdown automata
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Context-Dependent nondeterminism for pushdown automata
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
| Hi-index | 0.00 |
We recall the notion of regular closure of classes of languages. We present two important results. The first result is that all languages which are in the regular closure of the class of deterministic (context-free) languages can be recognized in linear time. This is a nontrivial result, since this closure contains many inherently ambiguous languages. The second result is that the class of deterministic languages is contained in the closure of the class of deterministic languages with the prefix property or, stated in an equivalent way, all LR(k) languages are in the regular closure of the class of LR(0) languages.