The following pages link to Kai Salomaa (Q247255):
Displaying 50 items.
- Degrees of restriction for two-dimensional automata (Q2117665) (← links)
- Nondeterministic state complexity of site-directed deletion (Q2164749) (← links)
- Decision problems for restricted variants of two-dimensional automata (Q2177610) (← links)
- Limited nondeterminism of input-driven pushdown automata: decidability and complexity (Q2179335) (← links)
- Nondeterminism growth and state complexity (Q2179339) (← links)
- Nondeterministic state complexity of nested word automata (Q2271435) (← links)
- On the synchronized derivation depth of context-free grammars (Q2271456) (← links)
- On the descriptional complexity of Watson-Crick automata (Q2271460) (← links)
- Operational state complexity of nested word automata (Q2271464) (← links)
- The relative edit-distance between two input-driven languages (Q2327548) (← links)
- Site-directed insertion: language equations and decision problems (Q2334603) (← links)
- State complexity of prefix distance (Q2357110) (← links)
- State complexity of permutation on finite languages over a binary alphabet (Q2358683) (← links)
- State complexity of combined operations (Q2383591) (← links)
- State complexity of operations on input-driven pushdown automata (Q2396831) (← links)
- Branching measures and nearly acyclic NFAs (Q2401003) (← links)
- State complexity of suffix distance (Q2401012) (← links)
- The quotient operation on input-driven pushdown automata (Q2401013) (← links)
- Pseudoknot-generating operation (Q2405891) (← links)
- Relative prefix distance between languages (Q2408810) (← links)
- An infinite hierarchy induced by depth synchronization (Q2465043) (← links)
- On the existence of regular approximations (Q2465045) (← links)
- Transition complexity of language operations (Q2465047) (← links)
- Decidability of trajectory-based equations (Q2575751) (← links)
- Generalized fairness and context-free languages (Q2714235) (← links)
- Loop-free alternating finite automata (Q2770691) (← links)
- Pseudoknot-Generating Operation (Q2794363) (← links)
- State complexity of Kleene-star operations on regular tree languages (Q2803055) (← links)
- Outfix-Guided Insertion (Q2817379) (← links)
- State Complexity of Prefix Distance of Subregular Languages (Q2829982) (← links)
- State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages (Q2843086) (← links)
- Nondeterministic State Complexity of Proportional Removals (Q2843088) (← links)
- Comparisons between Measures of Nondeterminism on Finite Automata (Q2843098) (← links)
- Finite Nondeterminism vs. DFAs with Multiple Initial States (Q2843099) (← links)
- Undecidability of state complexity (Q2855756) (← links)
- State Complexity of Kleene-Star Operations on Trees (Q2891328) (← links)
- State-size hierarchy for finite-state complexity (Q2909179) (← links)
- In Memoriam Sheng Yu (Q2914689) (← links)
- State Complexity of Deletion (Q2921973) (← links)
- Input-Driven Pushdown Automata with Limited Nondeterminism (Q2921977) (← links)
- Unary NFAs with Limited Nondeterminism (Q2938121) (← links)
- Pseudo-inversion on Formal Languages (Q2945533) (← links)
- Duplications and Pseudo-Duplications (Q2945563) (← links)
- State Complexity of Prefix Distance (Q2947426) (← links)
- State Complexity of Insertion (Q2970209) (← links)
- On Language Decompositions and Primality (Q3003471) (← links)
- Descriptional Complexity of Unambiguous Nested Word Automata (Q3004601) (← links)
- Undecidability of the State Complexity of Composed Regular Operations (Q3004607) (← links)
- Extended Watson-Crick L Systems with Regular Trigger Languages (Q3007718) (← links)
- SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES (Q3021987) (← links)
