On the Computational Complexity of Partial Word Automata Problems
From MaRDI portal
Publication:4589235
Recommendations
- scientific article; zbMATH DE number 1701356
- DNA Computing
- On the computational complexity of P automata
- State complexity of partial word finite automata
- Complexity of problems concerning reset words for some partial cases of automata
- On the state complexity of partial word DFAs
- Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
- On the Complexity of Deciding Avoidability of Sets of Partial Words
- On the complexity of deciding avoidability of sets of partial words
- Automata on Words
Cited in
(16)- On the state complexity of partial word DFAs
- Minimal partial languages and automata
- Regular languages of partial words
- State complexity of finite partial languages
- Partial word DFAs
- On the complexity of universality for partially ordered NFAs
- Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
- On the computational complexity of P automata
- Minimal partial languages and automata
- Hard counting problems for partial words
- Connecting partial words and regular languages
- State complexity of finite partial languages
- scientific article; zbMATH DE number 6004843 (Why is no real title available?)
- Computational and proof complexity of partial string avoidability
- The hardness of counting full words compatible with partial words
- State complexity of partial word finite automata
This page was built for publication: On the Computational Complexity of Partial Word Automata Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589235)
