The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
On codes with a finite deciphering delay: constructing uncompletable words
Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Lower bounds for natural proof systems
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
A series of slowly synchronizing automata with a zero state over a small alphabet
Information and Computation
Synchronizing Automata and the Černý Conjecture
Language and Automata Theory and Applications
The equivalence problem for regular expressions with squaring requires exponential space
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Descriptional and Computational Complexity of Finite Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
On NFAs where all states are final, initial, or both
Theoretical Computer Science
On the equivalence, containment, and covering problems for the regular and context-free languages
Journal of Computer and System Sciences
On non-complete sets and Restivo's conjecture
DLT'11 Proceedings of the 15th international conference on Developments in language theory
| Hi-index | 0.00 |
In this paper we consider the computational complexity of the following problems: given a DFA or NFA representing a regular language L over a finite alphabet Σ, is the set of all prefixes (resp., suffixes, factors, subwords) of all words of L equal to Σ*? In the case of testing universality for factors of languages, there is a connection to two classic problems: the synchronizing words problem of Černý, and Restivo's conjecture on the minimal uncompletable word.