Pages that link to "Item:Q2334604"
From MaRDI portal
The following pages link to State complexity of unambiguous operations on finite automata (Q2334604):
Displaying 19 items.
- State complexity of operations on two-way finite automata over a unary alphabet (Q443746) (← links)
- Some results on the structure of unary unambiguous automata (Q544137) (← links)
- State complexity of unambiguous operations on deterministic finite automata (Q778004) (← links)
- State complexity of unique rational operations (Q1019724) (← links)
- State complexity of reversals of deterministic finite automata with output (Q1616967) (← links)
- On the number of active states in finite automata (Q2041683) (← links)
- State complexity of GF(2)-operations on unary languages (Q2113387) (← links)
- State-complexity hierarchies of uniform languages of alphabet-size length (Q2271458) (← links)
- Operational state complexity of nested word automata (Q2271464) (← links)
- Initial-state detectability and initial-state opacity of unambiguous weighted automata (Q2664211) (← links)
- Operations on Unambiguous Finite Automata (Q2817392) (← links)
- (Q4412108) (← links)
- Operations on Unambiguous Finite Automata (Q4683235) (← links)
- (Q4964021) (← links)
- Operational Accepting State Complexity: The Unary and Finite Case (Q5205038) (← links)
- State-complexity of finite-state devices, state compressibility and incompressibility (Q5289271) (← links)
- STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET (Q5462123) (← links)
- Operational State Complexity under Parikh Equivalence (Q5496197) (← links)
- Formal languages over GF(2) (Q5918612) (← links)