The following pages link to Kai Salomaa (Q247255):
Displaying 50 items.
- State Complexity of Operations on Input-Driven Pushdown Automata (Q3088065) (← links)
- Transformations Between Different Models of Unranked Bottom-Up Tree Automata (Q3100917) (← links)
- Transition Complexity of Incomplete DFAs (Q3100931) (← links)
- (Q3125168) (← links)
- A sharpening of the Parikh mapping (Q3147022) (← links)
- Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)
- Computing the Edit-Distance between a Regular Language and a Context-Free Language (Q3167486) (← links)
- State Complexity and Limited Nondeterminism (Q3167587) (← links)
- State Complexity of Projection and Quotient on Unranked Trees (Q3167589) (← links)
- Sheng Yu (1950–2012) In Memoriam (Q3168520) (← links)
- OVERLAP-FREE LANGUAGES AND SOLID CODES (Q3173944) (← links)
- STATE COMPLEXITY OF ADDITIVE WEIGHTED FINITE AUTOMATA (Q3401489) (← links)
- (Q3409979) (← links)
- (Q3429640) (← links)
- Generalizations of Code Languages with Marginal Errors (Q3451108) (← links)
- State Complexity of Neighbourhoods and Approximate Pattern Matching (Q3451118) (← links)
- ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION (Q3503086) (← links)
- Deterministic Caterpillar Expressions (Q3503898) (← links)
- (Q3505886) (← links)
- State Complexity of Basic Operations on Suffix-Free Regular Languages (Q3525596) (← links)
- STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES (Q3538851) (← links)
- Length Codes, Products of Languages and Primality (Q3540138) (← links)
- Iterated TGR Languages: Membership Problem and Effective Closure Properties (Q3591327) (← links)
- Language Decompositions, Primality, and Trajectory-Based Operations (Q3602796) (← links)
- Prime Decompositions of Regular Languages (Q3617053) (← links)
- State Complexity of Nested Word Automata (Q3618567) (← links)
- A Cryptosystem Based on the Composition of Reversible Cellular Automata (Q3618591) (← links)
- State Complexity of Combined Operations for Prefix-Free Regular Languages (Q3618598) (← links)
- Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages (Q3625777) (← links)
- A Cellular Automaton Model for Car Traffic with a Slow-to-Stop Rule (Q3637340) (← links)
- (Q3654092) (← links)
- (Q3655366) (← links)
- Direction independent context-sensitive grammars (Q3735093) (← links)
- (Q3735094) (← links)
- (Q3758109) (← links)
- Yield-languages recognized by alternating tree recognizers (Q3804222) (← links)
- (Q3813317) (← links)
- Hierarchy of k-context-free languages part 1 (Q3826119) (← links)
- Hierarchy of<i>k</i>-context-free languages (Q3826120) (← links)
- Representation of recursively enumerable languages using alternating finite tree recognizers (Q3974879) (← links)
- (Q4033499) (← links)
- (Q4036177) (← links)
- (Q4217608) (← links)
- (Q4264099) (← links)
- (Q4266531) (← links)
- (Q4284264) (← links)
- Semantics of trees (Q4285625) (← links)
- (Q4336269) (← links)
- (Q4341028) (← links)
- Complexity of E0L structural equivalence (Q4359286) (← links)
