Rationality in algebras with a series operation
Information and Computation
Sequential grammars and automata with valances
Theoretical Computer Science
Checking Simple Properties of Transition Systems Defined by Thue Specifications
Journal of Automated Reasoning
Conjunctive Grammars and Systems of Language Equations
Programming and Computing Software
A Chomsky-Like Hierarchy of Infinite Graphs
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
The Entropy of Lukasiewicz-Languages
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Inferring Deterministic Linear Languages
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Ambiguity in omega context free languages
Theoretical Computer Science
A new algorithm for regularizing one-letter context-free grammars
Theoretical Computer Science
A characterization of s-languages
Information Processing Letters
Dynamic compilation of weighted context-free grammars
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Representing recursively enumerable languages by iterated deletion
Theoretical Computer Science
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
On the number of nonterminals in linear conjunctive grammars
Theoretical Computer Science
Information and Computation
Theoretical Computer Science - Mathematical foundations of computer science 2004
Unresolved systems of language equations: expressive power and decision problems
Theoretical Computer Science
Computational Universality in One-variable Language Equations
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
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
Self-regulating finite automata
Acta Cybernetica
On complexity functions of infinite words associated with generalized Dyck languages
Theoretical Computer Science
Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Adding nesting structure to words
Journal of the ACM (JACM)
On universal computably enumerable prefix codes
Mathematical Structures in Computer Science
Regulated nondeterminism in pushdown automata
Theoretical Computer Science
Information and Computation
Some properties of ciliate bio-operations
DLT'02 Proceedings of the 6th international conference on Developments in language theory
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Decision problems for language equations with Boolean operations
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A logical characterisation of linear time on nondeterministic turing machines
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
The descriptive complexity approach to LOGCFL
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Decision problems for language equations
Journal of Computer and System Sciences
Regulated nondeterminism in pushdown automata
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
A simple P-complete problem and its representations by language equations
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Block insertion and deletion on trajectories
Theoretical Computer Science
An automata-theoretical characterization of context-free trace languages
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Diagnosability of pushdown systems
HVC'09 Proceedings of the 5th international Haifa verification conference on Hardware and software: verification and testing
Grammar semantics, analysis and parsing by abstract interpretation
Theoretical Computer Science
Quasi-rocking real-time pushdown automata
Theoretical Computer Science
On the complexity of a family of k-context-free sequences
Theoretical Computer Science
Language equations with symmetric difference
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Model checking multithreaded programs with asynchronous atomic methods
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Context-Bounded model checking of concurrent software
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
TSD'06 Proceedings of the 9th international conference on Text, Speech and Dialogue
On computational universality in language equations
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Concatenation state machines and simple functions
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
On the Hausdorff measure of ω-power languages
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
On CD-systems of stateless deterministic R-automata with window size one
Journal of Computer and System Sciences
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Descriptional complexity of pushdown store languages
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Homomorphisms preserving deterministic context-free languages
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Computational Universality in One-variable Language Equations
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Thue Specifications and Their Monadic Second-order Properties
Fundamenta Informaticae
Language Equations with Symmetric Difference
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
| Hi-index | 0.01 |