The following pages link to Arto Salomaa (Q235701):
Displaying 50 items.
- Conducting secret ballot elections in computer networks: Problems and solutions (Q1339204) (← links)
- Computing by splicing (Q1349864) (← links)
- Slender 0L languages (Q1351458) (← links)
- Simple splicing systems (Q1392573) (← links)
- Watson-Crick D0L systems: The power of one transition (Q1399987) (← links)
- Power and size of extended Watson-Crick \(L\) systems. (Q1401185) (← links)
- Cartesian authentication codes from functions with optimal nonlinearity. (Q1401188) (← links)
- From Watson-Crick L systems to Darwinian P systems (Q1410768) (← links)
- On strongly context-free languages (Q1570831) (← links)
- On slender 0L languages (Q1575938) (← links)
- Language-theoretic aspects of DNA complementarity (Q1589432) (← links)
- ICALP, EATCS and Maurice Nivat (Q1603682) (← links)
- Uni-transitional Watson-Crick D0L systems (Q1603703) (← links)
- Three constructions of authentication/secrecy codes (Q1770530) (← links)
- DNA computing. New computing paradigms. (Q1773217) (← links)
- Solution of a decision problem concerning unary Lindenmayer systems (Q1846337) (← links)
- Topics in the theory of DNA computing. (Q1853473) (← links)
- Composition sequences for functions over a finite domain. (Q1853744) (← links)
- Some decision problems concerning semilinearity and commutation. (Q1872706) (← links)
- Subword histories and Parikh matrices (Q1878676) (← links)
- Decision problems for patterns (Q1892205) (← links)
- Thin and slender languages (Q1897353) (← links)
- P, NP, and the Post correspondence problem (Q1899905) (← links)
- Functions and sequences generated by reaction systems (Q1935775) (← links)
- Subword balance, position indices and power sums (Q1959432) (← links)
- On the expressiveness of subset-sum representations (Q1977079) (← links)
- Minimal reaction systems: duration and blips (Q2358692) (← links)
- State complexity of combined operations (Q2383591) (← links)
- Connections between subwords and certain matrix mappings (Q2484434) (← links)
- Independence of certain quantities indicating subword occurrences (Q2508977) (← links)
- On sentential forms of context-free grammars (Q2561842) (← links)
- Watson-Crick walks and roads on D0L Graphs (Q2707236) (← links)
- On the decomposition of finite languages (Q2708948) (← links)
- Restricted use of the splicing operation<sup>1</sup> (Q2710743) (← links)
- Mathematical properties of a particular type of DNA recombination (Q2770688) (← links)
- Compositions over a finite domain: From completeness to synchronizable automata (Q2776610) (← links)
- (Q2785557) (← links)
- Two-step simulations of reaction systems by minimal ones (Q2803045) (← links)
- Functional constructions between reaction systems and propositional logic (Q2841991) (← links)
- Undecidability of state complexity (Q2855756) (← links)
- Composition Sequences and Synchronizing Automata (Q2891329) (← links)
- Mirror images and schemes for the maximal complexity of nondeterminism (Q2893313) (← links)
- On State Sequences Defined by Reaction Systems (Q2897958) (← links)
- Minimal Reaction Systems Defining Subset Functions (Q2944907) (← links)
- (Q3002507) (← links)
- Undecidability of the State Complexity of Composed Regular Operations (Q3004607) (← links)
- On Some Biologically Motivated Control Devices for Parallel Rewriting (Q3009346) (← links)
- MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY (Q3021998) (← links)
- Systolic trellis automata: Stability, decidability and complexity (Q3030260) (← links)
- On non context-free grammar forms (Q3051397) (← links)
