Some applications of a theorem of Shirshov to language theory
Information and Control
On cancellation properties of languages which are supports of rational power series
Journal of Computer and System Sciences
Theoretical Computer Science
Finitely generated sofic systems
Theoretical Computer Science - Conference on arithmetics and coding systems, Marseille-Luminy, June 1987
Theoretical Computer Science - Special issue on theoretical computer science, algebra and combinatorics
Proceedings of the LITP Spring School on Theoretical Computer Science on Formal properties of finite automata and applications
Coding sequences with constraints
Sequences
STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
Theoretical Computer Science - Special issue on discrete mathematics and applications to computer science
Theoretical Computer Science
Monadic second-order logic over rectangular pictures and recognizability by tiling systems
Information and Computation
Two-dimensional finite state recognizability
Fundamenta Informaticae - Special issue on formal language theory
Handbook of formal languages, vol. 3
Periodicity and the golden ratio
Theoretical Computer Science - Special issue: papers dedicated to the memory of Marcel-Paul Schützenberger
Theoretical Computer Science
Information Processing Letters
Fine and Wilf's theorem for three periods and a generalization of Sturmian words
Theoretical Computer Science
Extending formal language hierarchies to higher dimensions
ACM Computing Surveys (CSUR)
Regular Article: Forbidden Words in Symbolic Dynamics
Advances in Applied Mathematics
Theoretical Computer Science
Recurrence and periodicity in infinite words from local periods
Theoretical Computer Science
Theoretical Computer Science
On the lattice of prefix codes
Theoretical Computer Science
Periodicity vectors for labelled trees
Discrete Applied Mathematics
On Fine and Wilf's theorem for bidimensional words
Theoretical Computer Science
Overlap-free words on two symbols
Automata on Infinite Words, Ecole de Printemps d'Informatique Théorique,
Representations lf Integers and Language Theory
Proceedings of the Mathematical Foundations of Computer Science 1984
A Periodicity Theorem on Words and Applications
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
MFCS '96 Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science
Minimal Forbidden Words and Factor Automata
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Forbidden Factors in Finite and Infinite Words
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Some Decision Results for Recognizable Sets in Arbitrary Monoids
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
On Some Properties of Local Testability
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Minimal Forbidden Words and Symbolic Dynamics
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
1. Fachtagung über Automatentheorie und Formale Sprachen
A characterization of bounded regular sets
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Forbidden Factors and Fragment Assembly
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Cancellation, Pumping and Permutation in Formal Languages
Proceedings of the 11th Colloquium on Automata, Languages and Programming
Monadic Second-Order Logic Over Pictures and Recognizability by Tiling Systems
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Binary patterns in infinite binary words
Formal and natural computing
Burrows--Wheeler transform and Sturmian words
Information Processing Letters
Computing forbidden words of regular languages
Fundamenta Informaticae - Special issue on computing patterns in strings
On the trace product and some families of languages closed under partial commutations
Journal of Automata, Languages and Combinatorics
Patterns in words and languages
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
Indexing structures for approximate string matching
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Varieties of codes and kraft inequality
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Ordering and convex polyominoes
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
| Hi-index | 0.00 |