The following pages link to Kai Salomaa (Q247255):
Displaying 50 items.
- Extended Watson-Crick L systems with regular trigger languages and restricted derivation modes (Q256437) (← links)
- Approximate matching between a context-free grammar and a finite-state automaton (Q259082) (← links)
- State complexity of the concatenation of regular tree languages (Q418803) (← links)
- Descriptional complexity of unambiguous input-driven pushdown automata (Q484313) (← links)
- Limitations of lower bound methods for deterministic nested word automata (Q553328) (← links)
- Structural equivalence and ET0L grammars (Q671426) (← links)
- Decidability of equivalence for deterministic synchronized tree automata (Q671682) (← links)
- Lower bounds for the size of deterministic unranked tree automata (Q714828) (← links)
- Finite state complexity (Q719308) (← links)
- Site-directed insertion: decision problems, maximality and minimality (Q777987) (← links)
- Cycle height of finite automata (Q778006) (← links)
- Alternating finite automata with limited universal branching (Q782574) (← links)
- Decidability of structural equivalence of E0L grammars (Q807023) (← links)
- Concatenation operations and restricted variants of two-dimensional automata (Q831799) (← links)
- Deciding determinism of caterpillar expressions (Q840761) (← links)
- Codes defined by multiple sets of trajectories (Q860886) (← links)
- On the existence of prime decompositions (Q880173) (← links)
- State complexity of inversion operations (Q896671) (← links)
- Operational state complexity of unary NFAs with finite nondeterminism (Q896686) (← links)
- The immortality problem for Lag systems (Q918728) (← links)
- Lower bounds for the transition complexity of NFAs (Q955341) (← links)
- State complexity of basic operations on suffix-free regular languages (Q1029324) (← links)
- Variants of codes and indecomposable languages (Q1041051) (← links)
- A pumping result for 2-context-free languages (Q1114418) (← links)
- Deterministic tree pushdown automata and monadic tree rewriting systems (Q1118421) (← links)
- Synchronization expressions with extended join operation (Q1274985) (← links)
- The state complexities of some basic operations on regular languages (Q1318694) (← links)
- Synchronized tree automata (Q1325832) (← links)
- Measures of nondeterminism for pushdown automata (Q1337469) (← links)
- Transducers and the decidability of independence in free monoids (Q1341744) (← links)
- Yield-languages of two-way pushdown tree automata (Q1352013) (← links)
- (Q1575673) (redirect page) (← links)
- Alternating finite automata and star-free languages (Q1575674) (← links)
- Efficient implementation of regular languages using reversed alternating finite automata (Q1575901) (← links)
- Decidability of EDT0L structural equivalence (Q1605312) (← links)
- Site-directed deletion (Q1622963) (← links)
- Outfix-guided insertion (Q1682857) (← links)
- Routing in a polygonal terrain with the shortest beacon watchtower (Q1699277) (← links)
- Decision problems for patterns (Q1892205) (← links)
- P, NP, and the Post correspondence problem (Q1899905) (← links)
- Analysis of a cellular automaton model for car traffic with a slow-to-stop rule (Q1959659) (← links)
- Pseudo-inversion: closure properties and decidability (Q2003444) (← links)
- Decision problems and projection languages for restricted variants of two-dimensional automata (Q2029491) (← links)
- Combining limited parallelism and nondeterminism in alternating finite automata (Q2040412) (← links)
- Recognition and complexity results for projection languages of two-dimensional automata (Q2040423) (← links)
- Consensus string problem for multiple regular languages (Q2042725) (← links)
- Width measures of alternating finite automata (Q2096586) (← links)
- Deciding path size of nondeterministic (and input-driven) pushdown automata (Q2098178) (← links)
- On Simon's congruence closure of a string (Q2112187) (← links)
- Structural properties of NFAs and growth rates of nondeterminism measures (Q2113384) (← links)
