The following pages link to Kai Salomaa (Q247255):
Displaying 37 items.
- Approximate Matching between a Context-Free Grammar and a Finite-State Automaton (Q5327490) (← links)
- Ambiguity, Nondeterminism and State Complexity of Finite Automata (Q5350151) (← links)
- (Q5376342) (← links)
- Top-Down Tree Edit-Distance of Regular Tree Languages (Q5404936) (← links)
- (Q5422230) (← links)
- Descriptional Complexity of Nondeterministic Finite Automata (Q5428217) (← links)
- State Complexity of Union and Intersection of Finite Languages (Q5428233) (← links)
- (Q5485994) (← links)
- GOODBY TO THE KINDHEARTED DRAGON PROF. SHENG YU, 1950–2012 (Q5495413) (← links)
- THE EDIT-DISTANCE BETWEEN A REGULAR LANGUAGE AND A CONTEXT-FREE LANGUAGE (Q5495420) (← links)
- State Complexity of Inversion Operations (Q5496181) (← links)
- Computation Width and Deviation Number (Q5496185) (← links)
- State Complexity of Unary Language Operations for NFAs with Limited Nondeterminism (Q5496200) (← links)
- Nondeterministic Tree Width of Regular Languages (Q5500678) (← links)
- Quasi-Distances and Weighted Finite Automata (Q5500694) (← links)
- The State Complexity of Permutations on Finite Languages over Binary Alphabets (Q5500695) (← links)
- Lower bound for converting an NFA with finite nondeterminism into an MDFA (Q5507074) (← links)
- A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS (Q5696950) (← links)
- RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS (Q5704372) (← links)
- Consensus String Problem for Multiple Regular Languages (Q5738997) (← links)
- (Q5740432) (← links)
- Lower Bounds for the Transition Complexity of NFAs (Q5756712) (← links)
- (Q5867523) (← links)
- Theory Is Forever (Q5894883) (← links)
- Further closure properties of input-driven pushdown automata (Q5896094) (← links)
- Closest substring problems for regular languages (Q5915558) (← links)
- Closest substring problems for regular languages (Q5918147) (← links)
- Further closure properties of input-driven pushdown automata (Q5919707) (← links)
- Edit distance neighbourhoods of input-driven pushdown automata (Q5920061) (← links)
- Edit distance neighbourhoods of input-driven pushdown automata (Q5920214) (← links)
- State complexity of deletion and bipolar deletion (Q5963404) (← links)
- On Simon's congruence closure of a string (Q6093575) (← links)
- Generalizations of Code Languages with Marginal Errors (Q6114833) (← links)
- Converting finite width AFAs to nondeterministic and universal finite automata (Q6131195) (← links)
- The nondeterministic state complexity of the site-directed deletion language operation (Q6175008) (← links)
- Maximal existential and universal width (Q6588086) (← links)
- Descriptional complexity of finite automata -- selected highlights (Q6614536) (← links)
