scientific article
From MaRDI portal
Publication:2893312
zbMath1279.68171MaRDI QIDQ2893312
Zhi Xu, Narad Rampersad, Jeffrey O. Shallit
Publication date: 20 June 2012
Full work available at URL: http://iospress.metapress.com/content/g461u042w2750v4g/fulltext.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
universalityfactorpolynomial timeprefixdecision problemPSPACE-completesynchronizing wordsubwordsynchronizing automatonsuffixRestivo's conjecture
Related Items (10)
Scattered Factor-Universality of Words ⋮ Word problems of groups: formal languages, characterizations and decidability ⋮ Absent Subsequences in Words ⋮ Approximate NFA universality and related problems motivated by information theory ⋮ On the state complexity of closures and interiors of regular languages with subwords and superwords ⋮ Preimage problems for deterministic finite automata ⋮ Complexity of universality and related problems for partially ordered NFAs ⋮ A tale of two diagnoses in probabilistic systems ⋮ Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity ⋮ On NFAs where all states are final, initial, or both
This page was built for publication:
