The following pages link to Takashi Yokomori (Q243844):
Displaying 50 items.
- A simple classification of the volvocine algae by formal languages (Q263559) (← links)
- Reaction automata (Q418799) (← links)
- On the properties of language classes defined by bounded reaction automata (Q714826) (← links)
- Semi-linearity, Parikh-boundedness and tree adjunct languages (Q799121) (← links)
- Doubler and linearizer: An approach toward a unified theory for molecular computing based on DNA complementarity (Q926525) (← links)
- Two complementary operations inspired by the DNA hairpin formation: Completion and reduction (Q1004085) (← links)
- An inverse homomorphic characterization of full principal AFL (Q1058861) (← links)
- Erratum to: ``A three-restricted normal form theorem for ETOL languages (Q1061489) (← links)
- Set abstraction - an extension of all solutions predicate in logic programming language (Q1094865) (← links)
- On purely morphic characterizations of context-free languages (Q1098315) (← links)
- A three-restricted normal form theorem for ETOL languages (Q1163380) (← links)
- Learning approximately regular languages with reversible languages (Q1269920) (← links)
- Tree adjoining grammars for RNA structure prediction (Q1274602) (← links)
- On the computational power of insertion-deletion systems (Q1426832) (← links)
- (Q1606794) (redirect page) (← links)
- Toward soft hardware (Q1606795) (← links)
- Computing with multisets: a survey on reaction automata theory (Q1670772) (← links)
- Logic program forms (Q1822224) (← links)
- Corrigendum. Learning two-tape automata from queries and counterexamples (Q1849752) (← links)
- Molecular computing paradigm -- toward freedom from Turing's charm (Q1871865) (← links)
- Polynomial-time identification of very simple grammars from positive data. (Q1874233) (← links)
- On the power of membrane division in P systems (Q1882915) (← links)
- On polynomial-time learnability in the limit of strictly deterministic automata (Q1900980) (← links)
- Theory of reaction automata: a survey (Q1983008) (← links)
- On the computing powers of \(\mathcal{L}\)-reductions of insertion languages (Q1998879) (← links)
- Corrigendum to: ``On the computing powers of \(\mathcal{L}\)-reductions of insertion languages'' (Q2139059) (← links)
- \(\mathcal{L}\)-reduction computation revisited (Q2170281) (← links)
- The computational capability of chemical reaction automata (Q2311219) (← links)
- Decomposition and factorization of chemical reaction transducers (Q2422041) (← links)
- (Q2708949) (← links)
- Finite Automata with Multiset Memory: A New Characterization of Chomsky Hierarchy (Q2805444) (← links)
- The Computational Capability of Chemical Reaction Automata (Q2921472) (← links)
- SOME REMARKS ON THE HAIRPIN COMPLETION (Q3056283) (← links)
- MORPHIC CHARACTERIZATIONS OF LANGUAGE FAMILIES IN TERMS OF INSERTION SYSTEMS AND STAR LANGUAGES (Q3076617) (← links)
- On the Hairpin Incompletion (Q3100941) (← links)
- FAMILIES OF NONCOUNTING LANGUAGES AND THEIR LEARNABILITY FROM POSITIVE DATA (Q3126016) (← links)
- (Q3126921) (← links)
- (Q3225710) (← links)
- REPRESENTATIONS AND CHARACTERIZATIONS OF LANGUAGES IN CHOMSKY HIERARCHY BY MEANS OF INSERTION-DELETION SYSTEMS (Q3526540) (← links)
- Linearizer and Doubler : Two Mappings to Unify Molecular Computing Models Based on DNA Complementarity (Q3618690) (← links)
- (Q3714466) (← links)
- (Q3769992) (← links)
- Inductive inference of context-free languages based on context-free expressions (Q3806846) (← links)
- Stochastic characterizations of E0L languages (Q3886883) (← links)
- (Q4036762) (← links)
- (Q4247007) (← links)
- (Q4263695) (← links)
- (Q4267806) (← links)
- (Q4370216) (← links)
- (Q4414687) (← links)
