Binary (generalized) post correspondence problem
Theoretical Computer Science
The equality problem for Parikh simple algebraic power series
Information Processing Letters
On the combinatorial alphabets of a language
Journal of Automata, Languages and Combinatorics
The Equivalence Problem of Finite Substitutions on ab*c, with Applications
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On the Complexity of Free Monoid Morphisms
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Decision Questions on Integer Matrices
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Coding Properties of DNA Languages
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Generalized PCP Is Decidable for Marked Morphisms
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Coding properties of DNA languages
Theoretical Computer Science
Polynomial versus exponential growth in repetition-free binary words
Journal of Combinatorial Theory Series A
Many aspects of defect theorems
Theoretical Computer Science - Words, languages and combinatorics
Equality sets of prefix morphisms and regular star languages
Information Processing Letters
Valence languages generated by equality sets
Journal of Automata, Languages and Combinatorics
A Formal Language Analysis of DNA Hairpin Structures
Fundamenta Informaticae
Undecidability in ω-Regular Languages
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
More decidable instances of Post's correspondence problem: beyond counting
Information Processing Letters
Discontinuities in pattern inference
Theoretical Computer Science
Post Correspondence Problem for short words
Information Processing Letters
Journal of Automata, Languages and Combinatorics
The unambiguity of segmented morphisms
Discrete Applied Mathematics
Restricted ambiguity of erasing morphisms
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Restricted ambiguity of erasing morphisms
Theoretical Computer Science
On hairpin-free words and languages
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
On codes defined by bio-operations
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
On the equivalence problem for e-pattern languages over small alphabets
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Theoretical Computer Science
The Unique Decipherability in the Monoid of Regular Languages is Undecidable
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Regular and context-free pattern languages over small alphabets
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
A Formal Language Analysis of DNA Hairpin Structures
Fundamenta Informaticae
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Undecidability in ω-Regular Languages
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
A Characterization of Regular Languages as Equality Sets of HDT0L Sequences
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Unambiguous 1-uniform morphisms
Theoretical Computer Science
Regular and context-free pattern languages over small alphabets
Theoretical Computer Science
| Hi-index | 0.01 |