A property of real-time trellis automata
Discrete Applied Mathematics
On real time one-way cellular array
Theoretical Computer Science
Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Church-Rosser Languages vs. UCFL
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Information and Computation
Recursive descent parsing for Boolean grammars
Acta Informatica
A simple P-complete problem and its representations by language equations
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Well-Founded semantics for boolean grammars
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Information and Computation
A simple P-complete problem and its language-theoretic representations
Theoretical Computer Science
| Hi-index | 0.00 |
The family of languages generated by Boolean grammars and usable with recursive descent parsing is studied. It is demonstrated that Boolean LL languages over a unary alphabet are regular, while Boolean LL subsets of Σ*a* obey a certain periodicity property, which, in particular, makes the language {anb2n | n ≥ 0} nonrepresentable. It is also shown that {anbncs | n ≥ 0, s ∈ {a, b}} is not generated by any linear conjunctive LL grammar, while linear Boolean LL grammars cannot generate {anbnc* | n ≥ 0}.