Complete inverted files for efficient text retrieval and analysis
Journal of the ACM (JACM)
Computer algebra (2nd ed.): systems and algorithms for algebraic computation
Computer algebra (2nd ed.): systems and algorithms for algebraic computation
An introduction to symbolic dynamics and coding
An introduction to symbolic dynamics and coding
On the bound of the synchronization delay of a local automaton
Theoretical Computer Science
Information Processing Letters
Regular Article: Forbidden Words in Symbolic Dynamics
Advances in Applied Mathematics
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Forbidden Factors in Finite and Infinite Words
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Text Compression Using Antidictionaries
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Theoretical Computer Science - The art of theory
Codes, unambiguous automata and sofic systems
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Word assembly through minimal forbidden words
Theoretical Computer Science
Outfix-Free Regular Languages and Prime Outfix-Free Decomposition
Fundamenta Informaticae
Decision Problems for Convex Languages
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Theoretical Computer Science
Decision problems for convex languages
Information and Computation
Information and Computation
Building phylogeny with minimal absent words
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Outfix-free regular languages and prime outfix-free decomposition
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Automata and differentiable words
Theoretical Computer Science
Using minimal absent words to build phylogeny
Theoretical Computer Science
Characterizing languages by normalization and termination in string rewriting
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Hi-index | 0.00 |
We give a quadratic-time algorithm to compute the set of minimal forbidden words of a factorial regular language. We give a linear-time algorithm to compute the minimal forbidden words of a finite set of words. This extends a previous result given for the case of a single word only.We also give quadratic-time algorithms to check whether a regular language is factorial or anti-factorial.