Pages that link to "Item:Q5704377"
From MaRDI portal
The following pages link to DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY (Q5704377):
Displayed 18 items.
- Unambiguous finite automata over a unary alphabet (Q418147) (← links)
- Descriptional complexity of unambiguous input-driven pushdown automata (Q484313) (← links)
- Two-way unary automata versus logarithmic space (Q549665) (← links)
- Lower bounds for the size of deterministic unranked tree automata (Q714828) (← links)
- On the state complexity of closures and interiors of regular languages with subwords and superwords (Q896684) (← links)
- Operational state complexity of unary NFAs with finite nondeterminism (Q896686) (← links)
- Ambiguity and structural ambiguity of symmetric difference NFAs (Q2453538) (← links)
- From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity (Q2800411) (← links)
- Operations on Unambiguous Finite Automata (Q2817392) (← links)
- IN MEMORIAM CHANDRA KINTALA (Q2909177) (← links)
- On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages (Q2944880) (← links)
- Ambiguity of Unary Symmetric Difference NFAs (Q3105754) (← links)
- Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)
- Operations on Unambiguous Finite Automata (Q4683235) (← links)
- Worst Case Branching and Other Measures of Nondeterminism (Q5268392) (← links)
- Unambiguity in Automata Theory (Q5500675) (← links)
- Nondeterministic Tree Width of Regular Languages (Q5500678) (← links)
- The \(k\)-distinct language: parameterized automata constructions (Q5964071) (← links)