The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages (Q2893312)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6048142
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages |
scientific article; zbMATH DE number 6048142 |
Statements
20 June 2012
0 references
prefix
0 references
suffix
0 references
factor
0 references
subword
0 references
universality
0 references
PSPACE-complete
0 references
decision problem
0 references
polynomial time
0 references
synchronizing word
0 references
synchronizing automaton
0 references
Restivo's conjecture
0 references
The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages (English)
0 references
0.7801427841186523
0 references
0.7730340361595154
0 references
0.7651793956756592
0 references
0.7605166435241699
0 references
0.7597105503082275
0 references
