The following pages link to (Q3102144):
Displayed 38 items.
- Extended regular expressions: succinctness and decidability (Q372977) (← links)
- Descriptional complexity of bounded context-free languages (Q383365) (← links)
- Nondeterministic state complexity of star-free languages (Q442152) (← links)
- On a structural property in the state complexity of projected regular languages (Q443744) (← links)
- Descriptional complexity of two-way pushdown automata with restricted head reversals (Q443747) (← links)
- Quantum finite automata: advances on Bertoni's ideas (Q517033) (← links)
- On families of categorial grammars of bounded value, their learnability and related complexity questions (Q714784) (← links)
- Boundary sets of regular and context-free languages (Q896680) (← links)
- Document spanners: from expressive power to decision problems (Q1650917) (← links)
- The descriptional power of queue automata of constant length (Q2041686) (← links)
- Deterministic and nondeterministic iterated uniform finite-state transducers: computational and descriptional power (Q2106594) (← links)
- Boolean kernels of context-free languages (Q2117675) (← links)
- Removing nondeterminism in constant height pushdown automata (Q2252532) (← links)
- Oblivious two-way finite automata: decidability and complexity (Q2252534) (← links)
- A multi-parameter analysis of hard problems on deterministic finite automata (Q2256724) (← links)
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties (Q2344746) (← links)
- The chop of languages (Q2358686) (← links)
- One-way reversible multi-head finite automata (Q2358688) (← links)
- Boolean language operations on nondeterministic automata with a pushdown of constant height (Q2403237) (← links)
- A hitchhiker's guide to descriptional complexity through analytic combinatorics (Q2437857) (← links)
- On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata (Q2914714) (← links)
- (Q4988162) (← links)
- Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers* (Q5089680) (← links)
- Cellular Automata: Descriptional Complexity and Decidability (Q5112166) (← links)
- Queue Automata: Foundations and Developments (Q5112182) (← links)
- Self-Verifying Pushdown and Queue Automata (Q5164866) (← links)
- Nondeterministic State Complexity of Star-Free Languages (Q5200063) (← links)
- State Complexity of Projected Languages (Q5200092) (← links)
- Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals (Q5200096) (← links)
- One-Time Nondeterministic Computations (Q5205043) (← links)
- Input-driven multi-counter automata (Q5918274) (← links)
- Descriptional complexity of iterated uniform finite-state transducers (Q5918615) (← links)
- (Q6070603) (← links)
- Syntax checking either way (Q6100187) (← links)
- Lyndon partial words and arrays with applications (Q6111445) (← links)
- Hierarchies and undecidability results for iterative arrays with sparse communication (Q6151193) (← links)
- Iterated uniform finite-state transducers on unary languages (Q6165558) (← links)
- On the undecidability and descriptional complexity of synchronized regular expressions (Q6171822) (← links)