Pages that link to "Item:Q2817392"
From MaRDI portal
The following pages link to Operations on Unambiguous Finite Automata (Q2817392):
Displaying 12 items.
- On the state complexity of operations on two-way finite automata (Q515574) (← links)
- State complexity of unambiguous operations on deterministic finite automata (Q778004) (← links)
- On degrees of ambiguity for Büchi tree automata (Q2051784) (← links)
- Performing regular operations with 1-limited automata (Q2164004) (← links)
- State complexity of unambiguous operations on finite automata (Q2334604) (← links)
- State complexity of operations on input-driven pushdown automata (Q2396831) (← links)
- Operations on Self-Verifying Finite Automata (Q3194721) (← links)
- Operations on Unambiguous Finite Automata (Q4683235) (← links)
- (Q4955261) (← links)
- A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton (Q5002825) (← links)
- Finite Automata on Unranked and Unordered DAGs (Q5428246) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465884) (← links)