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
On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy
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
Information and Computation
On state-alternating context-free grammars
Theoretical Computer Science
Journal of Automata, Languages and Combinatorics
Lower bound technique for length-reducing automata
Information and Computation
The size of Higman-Haines sets
Theoretical Computer Science
On determinism versus nondeterminism for restarting automata
Information and Computation
On Alternating Phrase-Structure Grammars
Language and Automata Theory and Applications
A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata
Language and Automata Theory and Applications
Monotonicity of restarting automata
Journal of Automata, Languages and Combinatorics
Non-recursive trade-offs for deterministic restarting automata
Journal of Automata, Languages and Combinatorics
The Boolean Closure of Growing Context-Sensitive Languages
Fundamenta Informaticae
On Stateless Deterministic Restarting Automata
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
More on the Size of Higman-Haines Sets: Effective Constructions
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Two-dimensional hierarchies of proper languages of lexicalized FRR-automata
Information and Computation
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
Computing languages by (Bounded) local sets
DLT'03 Proceedings of the 7th international conference on Developments in language theory
More on the size of higman-haines sets: effective constructions
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Complexity of multi-head finite automata: Origins and directions
Theoretical Computer Science
On restarting automata with window size one
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
On nonforgetting restarting automata that are deterministic and/or monotone
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
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
Learning analysis by reduction from positive data
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
On the gap-complexity of simple RL-Automata
DLT'06 Proceedings of the 10th 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
Regular languages are church-rosser congruential
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
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
More on the Size of Higman-Haines Sets: Effective Constructions
Fundamenta Informaticae - Machines, Computations and Universality, Part I
The Boolean Closure of Growing Context-Sensitive Languages
Fundamenta Informaticae
| Hi-index | 0.01 |