The following pages link to Kai Salomaa (Q247255):
Displaying 50 items.
- (Q4362739) (← links)
- Pumping and pushdown machines (Q4365009) (← links)
- (Q4390537) (← links)
- Regex and extended regex (Q4418600) (← links)
- (Q4431342) (← links)
- (Q4453466) (← links)
- (Q4474149) (← links)
- (Q4474150) (← links)
- (Q4500369) (← links)
- (Q4520282) (← links)
- (Q4520792) (← links)
- (Q4531373) (← links)
- State Complexity of k-Parallel Tree Concatenation (Q4601129) (← links)
- (Q4609332) (← links)
- Inclusion is undecidable for pattern languages (Q4630269) (← links)
- State Complexity of Neighbourhoods and Approximate Pattern Matching (Q4640043) (← links)
- Cellular Automaton Based Motion Planning Algorithms for Mobile Sensor Networks (Q4649274) (← links)
- (Q4662838) (← links)
- (Q4681310) (← links)
- Quasi-Distances and Weighted Finite Automata (Q4683187) (← links)
- Descriptional Complexity of Error Detection (Q4686648) (← links)
- (Q4713373) (← links)
- (Q4734779) (← links)
- (Q4737906) (← links)
- (Q4799361) (← links)
- (Q4807824) (← links)
- Pattern languages with and without erasing (Q4839719) (← links)
- (Q4840170) (← links)
- (Q4929403) (← links)
- (Q4941147) (← links)
- (Q4942249) (← links)
- (Q4955255) (← links)
- (Q4964008) (← links)
- (Q4964014) (← links)
- (Q4964021) (← links)
- (Q4964022) (← links)
- (Q4964025) (← links)
- Decidability of confluence and termination of monadic term rewriting systems (Q5055767) (← links)
- Decidability of equivalence for deterministic synchronized tree automata (Q5096728) (← links)
- Complexity of EOL structural equivalence (Q5096917) (← links)
- NONDETERMINISTIC STATE COMPLEXITY OF PROPORTIONAL REMOVALS (Q5173288) (← links)
- State Complexity of Finite Tree Width NFAs (Q5178457) (← links)
- State Trade-Offs in Unranked Tree Automata (Q5200097) (← links)
- Branching Measures and Nearly Acyclic NFAs (Q5205046) (← links)
- State Complexity of Suffix Distance (Q5205049) (← links)
- State Complexity of the Quotient Operation on Input-Driven Pushdown Automata (Q5205050) (← links)
- State Complexity of <i>k</i>-Union and <i>k</i>-Intersection for Prefix-Free Regular Languages (Q5261608) (← links)
- Worst Case Branching and Other Measures of Nondeterminism (Q5268392) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311144) (← links)
- (Q5313787) (← links)