Two-Way Restarting Automata and J-Monotonicity
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Context-free languages can be accepted with absolutely no space overhead
Information and Computation
Journal of Automata, Languages and Combinatorics
Sorted dependency insertion grammars
Theoretical Computer Science - Algebraic methods in language processing
Restarting automata with restricted utilization of auxiliary symbols
Theoretical Computer Science - Implementation and application of automata
Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automata
Theoretical Computer Science
Degrees of non-monotonicity for restarting automata
Theoretical Computer Science
Succinct description of regular languages by weak restarting automata
Information and Computation
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
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
Two-dimensional hierarchies of proper languages of lexicalized FRR-automata
Information and Computation
Context-free languages can be accepted with absolutely no space overhead
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
A measure for the degree of nondeterminism of context-free languages
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
On lookahead hierarchies for monotone and deterministic restarting automata with auxiliary symbols
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Transductions computed by PC-systems of monotone deterministic restarting automata
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Characterizing the regular languages by nonforgetting restarting automata
DLT'11 Proceedings of the 15th 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
On nonforgetting restarting automata that are deterministic and/or monotone
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Monotone deterministic RL-Automata don't need auxiliary symbols
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Modeling syntax of free word-order languages: dependency analysis by reduction
TSD'05 Proceedings of the 8th international conference on Text, Speech and Dialogue
On the complexity of 2-monotone restarting automata
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
On left-monotone deterministic 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
Restricting the use of auxiliary symbols for restarting automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
On the descriptional complexity of the window size for deterministic restarting automata
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Lambda-Confluence is undecidable for clearing restarting automata
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |