The following pages link to (Q5422234):
Displayed 36 items.
- Extended regular expressions: succinctness and decidability (Q372977) (← links)
- Descriptional complexity of bounded context-free languages (Q383365) (← links)
- Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata (Q388216) (← links)
- The tractability frontier for NFA minimization (Q414869) (← links)
- Descriptional complexity of two-way pushdown automata with restricted head reversals (Q443747) (← links)
- Optimal simulation of self-verifying automata by deterministic automata (Q553320) (← links)
- Complexity of multi-head finite automata: origins and directions (Q616495) (← links)
- Lower bounds for the size of deterministic unranked tree automata (Q714828) (← links)
- Operational state complexity of unary NFAs with finite nondeterminism (Q896686) (← links)
- Lower bounds for the transition complexity of NFAs (Q955341) (← links)
- On the descriptional complexity of finite automata with modified acceptance conditions (Q1763715) (← links)
- Succinct representations of languages by DFA with different levels of reliability (Q1763718) (← links)
- On the descriptional power of heads, counters, and pebbles (Q1763719) (← links)
- On two-way communication in cellular automata with a fixed number of cells (Q1763720) (← links)
- Context-free insertion-deletion systems (Q1763721) (← links)
- Complementing unary nondeterministic automata (Q1763723) (← links)
- Solving string problems on graphs using the labeled direct product (Q2088591) (← links)
- Deciding path size of nondeterministic (and input-driven) pushdown automata (Q2098178) (← links)
- Structural properties of NFAs and growth rates of nondeterminism measures (Q2113384) (← links)
- Removing nondeterminism in constant height pushdown automata (Q2252532) (← links)
- Operational state complexity of nested word automata (Q2271464) (← links)
- State complexity of permutation on finite languages over a binary alphabet (Q2358683) (← links)
- A hitchhiker's guide to descriptional complexity through analytic combinatorics (Q2437857) (← links)
- Complementing two-way finite automata (Q2643079) (← links)
- Improved complement for two-way alternating automata (Q2675811) (← links)
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
- State Complexity of Nested Word Automata (Q3618567) (← links)
- Converting Self-verifying Automata into Deterministic Automata (Q3618603) (← links)
- Size Complexity of Two-Way Finite Automata (Q3637213) (← links)
- Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals (Q5200096) (← links)
- One-Time Nondeterministic Computations (Q5205043) (← links)
- Branching Measures and Nearly Acyclic NFAs (Q5205046) (← links)
- Unambiguity in Automata Theory (Q5500675) (← links)
- The State Complexity of Permutations on Finite Languages over Binary Alphabets (Q5500695) (← links)
- Converting finite width AFAs to nondeterministic and universal finite automata (Q6131195) (← links)
- Existential and universal width of alternating finite automata (Q6175087) (← links)