Pages that link to "Item:Q3395129"
From MaRDI portal
The following pages link to NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY (Q3395129):
Displaying 31 items.
- Unambiguous finite automata over a unary alphabet (Q418147) (← links)
- Nondeterministic state complexity of star-free languages (Q442152) (← links)
- Incomplete operational transition complexity of regular languages (Q498392) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Lower bounds for the size of deterministic unranked tree automata (Q714828) (← links)
- State complexity of projection on languages recognized by permutation automata and commuting letters (Q832938) (← links)
- Operational state complexity of unary NFAs with finite nondeterminism (Q896686) (← links)
- On NFAs where all states are final, initial, or both (Q1034621) (← links)
- Finite nondeterministic automata: simulation and minimality (Q1575547) (← links)
- Finitely nonstationary nondeterministic automata with random input (Q1759520) (← links)
- Operational complexity and right linear grammars (Q2041682) (← links)
- On the number of active states in finite automata (Q2041683) (← links)
- State complexity of partial word finite automata (Q2096588) (← links)
- State complexity of finite partial languages (Q2112191) (← links)
- Operational complexity and pumping lemmas (Q2170280) (← links)
- State complexity of permutation on finite languages over a binary alphabet (Q2358683) (← links)
- (Q2753999) (← links)
- From finite automata to regular expressions and back -- a summary on descriptional complexity (Q2800411) (← links)
- The magic number problem for subregular language families (Q2909186) (← links)
- Run-Length Encoded Nondeterministic KMP and Suffix Automata (Q2947413) (← links)
- Analogs of Fagin’s Theorem for Small Nondeterministic Finite Automata (Q3167496) (← links)
- THE LENGTH OF SUBSET REACHABILITY IN NONDETERMINISTIC AUTOMATA (Q3646172) (← links)
- (Q5016366) (← links)
- Cellular Automata: Descriptional Complexity and Decidability (Q5112166) (← links)
- NONDETERMINISTIC STATE COMPLEXITY OF PROPORTIONAL REMOVALS (Q5173288) (← links)
- Nondeterministic State Complexity of Star-Free Languages (Q5200063) (← links)
- State Trade-Offs in Unranked Tree Automata (Q5200097) (← links)
- Operational Accepting State Complexity: The Unary and Finite Case (Q5205038) (← links)
- State complexity of finite partial languages (Q6100188) (← links)
- Further Remarks on the Operational Nonterminal Complexity (Q6114830) (← links)
- On Usefulness of Information: Framework and NFA Case (Q6163619) (← links)
