Characterizations of Recursively Enumerable Languages by Means of Insertion Grammars (original) (raw)
Related papers
Characterizations of recursively enumerable languages starting from internal contextual languages
Characterizations of recursively enumerable languages by using copy languages
Revue Roumaine des Mathematiques Pures et Appliquees
Characterizations of RE Languages by Means of Insertion Grammars
On characterizations of recursively enumerable languages
Acta Informatica, 1990
Morphic Characterizations of Language Families in Terms of Insertion Systems and Star Languages
International Journal of Foundations of Computer Science, 2011
International Journal of Foundations of Computer Science, 2008
On the Coding of a Turing Machines and Non - Recursive Languages
International Journal IJRITCC, B. Cassy
On strongly context-free languages
Discrete Applied Mathematics, 2000
Context-free insertion–deletion systems
Theoretical Computer Science, 2005
On the Mildly Context-Sensitive Characterization of Minimalist Grammars
On a classification of context-free languages
Kybernetika (Praha), 1967
Invariance: A Theoretical Approach for Coding Sets of Words Modulo Literal (Anti)Morphisms
Combinatorics on Words, 2017
Universal recursively enumerable sets of strings
Theoretical Computer Science, 2011
Embedding Properties of Total Recursive Functions
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 1982
Separating the Classes of Recursively Enumerable Languages Based on Machine Size
International Journal of Foundations of Computer Science, 2015
Definability of r. e. sets in a class of recursion theoretic structures
Journal of Symbolic Logic, 1983
Information and Control, 1978
Interpretability and definability in the recursively enumerable degrees
Proceedings of the …, 1998
n-Reconstructability of context-free grammars
Information Processing Letters, 1976
Traces of some primitive recursive schema
2010
Enumeration Reducibility and Computable Structure Theory
Computability and Complexity, 2016
Frontiers in Psychology, 2014
Finite models of infinite language: A connectionist approach to recursion
2001
Context-Sensitive String Languages and Recognizable Picture Languages
Information and Computation, 1997
Aperiodicity, Star-freeness, and First-order Definability of Structured Context-Free Languages
arXiv (Cornell University), 2020
A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets
Transactions of the American Mathematical Society, 1980
Theoretical Computer Science, 1982
Language as a discrete combinatorial system rather than a recursive embedding one
Linguistic review 31(1), 151-191, 2014
On arithmetical first-order theories allowing encoding and decoding of lists
Theoretical Computer Science, 1999
On some representations of context-free languages
2020
Journal of the ACM, 1966
Expressibility in the elementary theory of recursively enumerable sets with realizability logic
Algebra and Logic, 1981