Searching for "A Characterization of Recursively Enumerable Languages." – sorted by Relevance.
-
2-Testability and relabelings produce everything
- by replication or by splitting. In this case we prove a characterization of recursively enumerable languages
- Cited by 1 (0 self) – Add To MetaCart
-
On the Leftmost Derivation in Matrix Grammars
- but without appearance checking). Other three cases characterize the recursively enumerable languages modulo a
- Add To MetaCart
-
Cooperating Distributed Splicing Systems
- they are simultaneously bounded and still a characterization of recursively enumerable languages is obtained. 2 Formal
- Add To MetaCart
-
Parallel Communicating Watson-Crick Automata Systems
- as a characterization of recursively enumerable languages based on these systems. 1 Introduction Watson
- Cited by 1 (1 self) – Add To MetaCart
-
Parallel Communicating Watson-Crick Automata Systems
- as a characterization of recursively enumerable languages based on these systems. 1 Introduction
- Add To MetaCart
-
DNA Computing Based on Splicing: Universality Results
- characterization of recursively enumerable languages is obtained. The proof of this result from #4#doesnot give a
- Cited by 9 (0 self) – Add To MetaCart
-
Universality and Normal Forms on Membrane Systems
- characterize the one-letter Recursively Enumerable languages, and one conjecture was made: a characterization
- Cited by 3 (0 self) – Add To MetaCart
-
Computing with Membranes
- membranes are sufficient to generate non-context-free languages. A characterization of recursively
- Cited by 175 (2 self) – Add To MetaCart
-
Arithmetically Controlled H Systems
- , but we do not know whether or not this leads again to a characterization of recursively enumerable
- Cited by 1 (0 self) – Add To MetaCart
-
Sequential Grammars and Automata with Valences
- characterization of the context-free languages by nite valence automata over F 2 and a characterization
- Cited by 2 (0 self) – Add To MetaCart

