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
The context-splittable normal form for Church--Rosser language systems
Information and Computation - RTA 2001
Lower bound technique for length-reducing automata
Information and Computation
The Boolean Closure of Growing Context-Sensitive Languages
Fundamenta Informaticae
Restarting automata and their relations to the Chomsky hierarchy
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Computing languages by (Bounded) local sets
DLT'03 Proceedings of the 7th 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
The Boolean Closure of Growing Context-Sensitive Languages
Fundamenta Informaticae
Hi-index | 0.00 |