Pages that link to "Item:Q4589235"
From MaRDI portal
The following pages link to On the Computational Complexity of Partial Word Automata Problems (Q4589235):
Displaying 10 items.
- Regular languages of partial words (Q726150) (← links)
- On the computational complexity of P automata (Q876857) (← links)
- Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata (Q1678755) (← links)
- The hardness of counting full words compatible with partial words (Q1936243) (← links)
- State complexity of partial word finite automata (Q2096588) (← links)
- State complexity of finite partial languages (Q2112191) (← links)
- On the state complexity of partial word DFAs (Q2344741) (← links)
- (Q3115565) (← links)
- Computational and Proof Complexity of Partial String Avoidability (Q5061883) (← links)
- State complexity of finite partial languages (Q6100188) (← links)