The following pages link to (Q3680279):
Displaying 39 items.
- Products of matrices and recursively enumerable sets (Q473201) (← links)
- Many aspects of formal languages (Q805241) (← links)
- A deterministic algorithm for modular knapsack problems (Q809609) (← links)
- On a public-key cryptosystem based on iterated morphisms and substitutions (Q1098821) (← links)
- A D0L-T0L public key cryptosystem (Q1099130) (← links)
- On a subclass of \(\infty\)-regular languages (Q1104761) (← links)
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors (Q1109707) (← links)
- Observations concerning a public-key cryptosystem based on iterated morphisms (Q1121851) (← links)
- Computability and randomness of Nash equilibrium in infinite games (Q1177225) (← links)
- On number systems with finite degree of ambiguity (Q1271465) (← links)
- Reversibility and surjectivity problems of cellular automata (Q1318474) (← links)
- On recursive bounds for the exceptional values in speed-up (Q1334675) (← links)
- Rice's theorem for the limit sets of cellular automata (Q1342233) (← links)
- A family of NFAs which need 2\(^{n}-\alpha\) deterministic states (Q1400001) (← links)
- Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs (Q1566750) (← links)
- Finite nondeterministic automata: simulation and minimality (Q1575547) (← links)
- ``Viral'' Turing machines, computation from noise and combinatorial hierarchies (Q1694134) (← links)
- Derivation trees of ground term rewriting systems. (Q1854289) (← links)
- On the difficulty of making social choices (Q1891667) (← links)
- Finite transducers and rational transductions (Q2074205) (← links)
- Automata methods in transcendence (Q2197705) (← links)
- Quasi-universal \(k\)-regular sequences (Q2235748) (← links)
- Hierarchy and equivalence of multi-letter quantum finite automata (Q2271440) (← links)
- Well-structured languages (Q2641880) (← links)
- (Q3970886) (← links)
- (Q4344149) (← links)
- On Basic Properties of Jumping Finite Automata (Q4639928) (← links)
- Characterizing regular languages with polynomial densities (Q5096862) (← links)
- The finest homophonic partition and related code concepts (Q5096920) (← links)
- (Q5106345) (← links)
- Languages, Decidability, and Complexity (Q5496920) (← links)
- A survey of computational complexity results in systems and control (Q5926262) (← links)
- Multiple splicing systems and the universal computability (Q5941559) (← links)
- (Q6165566) (← links)
- Semigroup and monoid structures of \(\beta\)-languages (Q6165570) (← links)
- Bideterministic weighted automata (Q6186321) (← links)
- Semi-binary operations on \(\beta\)-languages (Q6541396) (← links)
- On some classes of semi-binary \(H\)-supersets (Q6541399) (← links)
- Hyper \(\beta\)-languages of order \(n\) (Q6543376) (← links)
