Properties that characterize LOGCFL
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Church-Rosser Languages vs. UCFL
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Prefix Languages of Church-Rosser Languages
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
On the Connections between Rewriting and Formal Language Theory
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
A Normal Form for Church-Rosser Language Systems
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
The Growing Context-Sensitive Languages Are the Acyclic Context-Sensitive Languages
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
McNaughton families of languages
Theoretical Computer Science
The context-splittable normal form for Church--Rosser language systems
Information and Computation - RTA 2001
Uniform recognition for acyclic context-sensitive grammars is NP-complete
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 4
Information and Computation
On state-alternating context-free grammars
Theoretical Computer Science
Journal of Automata, Languages and Combinatorics
Restarting automata with restricted utilization of auxiliary symbols
Theoretical Computer Science - Implementation and application of automata
Lower bound technique for length-reducing automata
Information and Computation
On Alternating Phrase-Structure Grammars
Language and Automata Theory and Applications
The Boolean Closure of Growing Context-Sensitive Languages
Fundamenta Informaticae
Church-Rosser groups and growing context-sensitive groups
Journal of Automata, Languages and Combinatorics
Information and Computation
Restarting automata and their relations to the Chomsky hierarchy
DLT'03 Proceedings of the 7th international conference on Developments in language theory
On restarting automata with window size one
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Lexicalized Non-Local MCTAG with Dominance Links is NP-Complete
Journal of Logic, Language and Information
Probabilistic length-reducing automata
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Shrinking multi-pushdown automata
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
On the complexity of 2-monotone restarting automata
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Decidability and complexity in automatic monoids
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
The boolean closure of growing context-sensitive languages
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Growing Grammars and Length-reducing Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
The Boolean Closure of Growing Context-Sensitive Languages
Fundamenta Informaticae
COMPLEXITY AND STRUCTURE IN FORMAL LANGUAGE THEORY
Fundamenta Informaticae
| Hi-index | 0.00 |