Computing forbidden words of regular languages

Authors:
Marie-Pierre Béal;Maxime Crochemore;Filippo Mignosi;Antonio Restivo;Marinella Sciortino
Affiliations:
Institut Gaspard-Monge, Université de Marne-la-Vallée, 77454 Marne-la-Vallée Cedex 2, France;Institut Gaspard-Monge, Université de Marne-la-Vallée, 77454 Marne-la-Vallée Cedex 2, France;Dipartimento di Matematica ed Applicazioni, Università di Palermo, Via Archirafi 34, 90123 Palermo, Italy;Dipartimento di Matematica ed Applicazioni, Università di Palermo, Via Archirafi 34, 90123 Palermo, Italy;Dipartimento di Matematica ed Applicazioni, Università di Palermo, Via Archirafi 34, 90123 Palermo, Italy
Venue:
Fundamenta Informaticae - Computing Patterns in Strings
Year:
2003

Citing 9
Cited 1

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
Automata and forbidden words

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

Outfix-Free Regular Languages and Prime Outfix-Free Decomposition

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.