The following pages link to Arto Salomaa (Q235701):
Displaying 50 items.
- (Q198271) (redirect page) (← links)
- Minimal and almost minimal reaction systems (Q272776) (← links)
- Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism (Q428858) (← links)
- Applications of the Chinese remainder theorem to reaction systems with duration (Q496027) (← links)
- On the state complexity of reversals of regular languages (Q596099) (← links)
- Pattern systems (Q672745) (← links)
- Multi-pattern languages (Q673787) (← links)
- Language-theoretic problems arising from Richelieu cryptosystems (Q685369) (← links)
- On the union of 0L languages (Q685483) (← links)
- L codes and number systems (Q788495) (← links)
- On a family of L languages resulting from systolic tree automata (Q800102) (← links)
- Many aspects of formal languages (Q805241) (← links)
- A deterministic algorithm for modular knapsack problems (Q809609) (← links)
- Subword conditions and subword histories (Q859831) (← links)
- On the existence of prime decompositions (Q880173) (← links)
- State complexity of basic language operations combined with reversal (Q948089) (← links)
- Subword histories and associated matrices (Q954996) (← links)
- Criteria for the matrix equivalence of words (Q964400) (← links)
- Variants of codes and indecomposable languages (Q1041051) (← links)
- Synchronized EOL forms (Q1056549) (← links)
- Context-free grammar forms with strict interpretations (Q1056550) (← links)
- On a public-key cryptosystem based on iterated morphisms and substitutions (Q1098821) (← links)
- Shuffle on trajectories: Syntactic constraints (Q1128661) (← links)
- DNA computing, sticker systems, and universality (Q1130166) (← links)
- On generators and generative capacity of EOL forms (Q1146007) (← links)
- Test sets and checking words for homomorphism equivalence (Q1148122) (← links)
- Colorings and interpretations: a connection between graphs and grammar forms (Q1155066) (← links)
- Sub-regular grammar forms (Q1160490) (← links)
- Completeness of context-free grammar forms (Q1160491) (← links)
- A homomorphic characterization of regular languages (Q1162364) (← links)
- Decidability and density in two-symbol grammar forms (Q1162822) (← links)
- Table systems with unconditional transfer (Q1165020) (← links)
- On infinite words obtained by iterating morphisms (Q1168084) (← links)
- Systolic automata for VLSI on balanced trees (Q1168737) (← links)
- Bounded delay L codes (Q1178694) (← links)
- Simple reductions between \(D0L\) language and sequence equivalence problems (Q1208490) (← links)
- Context-free grammars with graph-controlled tables (Q1230666) (← links)
- EOL forms (Q1234593) (← links)
- On the form equivalence of L-forms (Q1238427) (← links)
- New squeezing mechanisms for L systems (Q1240566) (← links)
- Isomorphism, form equivalence and sequence equivalence of PDOL forms (Q1242695) (← links)
- Bibliography of L systems (Q1245000) (← links)
- ETOL forms (Q1245577) (← links)
- On the decidability of homomorphism equivalence for languages (Q1251076) (← links)
- 2-testability and relabelings produce everything (Q1271607) (← links)
- Characterizations of recursively enumerable languages by means of insertion grammars (Q1275078) (← links)
- On well quasi orders of free monoids (Q1275465) (← links)
- A comparative overview of cryptographic voting protocols (Q1280581) (← links)
- Closure properties of slender languages (Q1314376) (← links)
- On simplest possible solutions for Post Correspondence Problems (Q1323352) (← links)
