Error-detecting properties of languages
Theoretical Computer Science
Rational Graphs Trace Context-Sensitive Languages
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
A Chomsky-Like Hierarchy of Infinite Graphs
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Grammar Systems as Language Analyzers and Recursively Enumerable Languages
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
On the Transition Graphs of Turing Machines
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
On the transition graphs of Turing machines
Theoretical Computer Science
Watson-Crick automata and PCFAS with two components: a computational power analogy
Proceedings of the 1st conference on Computing frontiers
Representing recursively enumerable languages by iterated deletion
Theoretical Computer Science
Theoretical Computer Science
Patterns in words and languages
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
Thue Specifications, Infinite Graphs and Synchronized Product
Fundamenta Informaticae
Nondeterministic Bimachines and Rational Relations with Finite Codomain
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Self-regulating finite automata
Acta Cybernetica
An algorithm for recognition of n-collapsing words
Theoretical Computer Science
On Alternating Phrase-Structure Grammars
Language and Automata Theory and Applications
On the Generative Power of Multiple Context-Free Grammars and Macro Grammars
IEICE - Transactions on Information and Systems
Descriptional Complexity of Tissue-Like P Systems with Cell Division
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
An inverse automata algorithm for recognizing 2-collapsing words
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Recognizing boolean closed A-tree languages with membership conditional rewriting mechanism
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
The descriptive complexity approach to LOGCFL
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Block insertion and deletion on trajectories
Theoretical Computer Science
Collapsing words: a progress report
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
On descriptive complexity of p systems
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Nondeterministic Bimachines and Rational Relations with Finite Codomain
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Thue Specifications, Infinite Graphs and Synchronized Product
Fundamenta Informaticae
| Hi-index | 0.01 |