Results 1 to 10 of about 793,130 (202)
A Homomorphic Characterization of Recursively Enumerable Languages
We give a homomorphic characterization of the class of recursively enumerable languages: it is shown that any recursively enumerable language is the homomorphic image of the intersection of a Dyck language and a 'minimal linear' language.
Sadaki Hirose
exaly +2 more sources
Representing Recursively Enumerable Languages by Iterated Deletion
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael Domaratzki, Alexander Okhotin
exaly +4 more sources
On Representing Recursively Enumerable Languages by Internal Contextual Languages
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Grzegorz Rozenberg, Andrzej Ehrenfeucht
exaly +3 more sources
A Representation of Recursively Enumerable Languages by Two Homomorphisms and a Quotient
For two strings x and y, \(x\setminus y\) is the string z when \(y=xz\); otherwise \(x\setminus y\) is undefined. The author proves the following representation theorem: For each recursively enumerable set L (over alphabet \(\Sigma)\) there exist two homomorphisms \(h_ 1\), \(h_ 2:\) \(\Sigma^*_ 1\to \Sigma^*_ 2\) \((\Sigma \subseteq \Sigma_ 2)\) such ...
Viliam Geffert
exaly +2 more sources
Homomorphic Characterizations of Recursively Enumerable Languages With Very Small Language Classes
In this paper, we attempt to characterize the class of recursively enumerable languages with much smaller language classes than that of linear languages. Language classes, \((i,j)\) LL and \((i,j)ML,\) of \((i,j)\) linear languages and \((i,j)\) minimal linear languages are defined by posing restrictions on the form of production rules and the number ...
Sadaki Hirose
exaly +3 more sources
Existential Definability over the Subword Ordering [PDF]
We study first-order logic (FO) over the structure consisting of finite words over some alphabet $A$, together with the (non-contiguous) subword ordering.
Pascal Baumann +3 more
doaj +1 more source
Computational Power of P Systems with Small Size Insertion and Deletion Rules [PDF]
Recent investigations show insertion-deletion systems of small size that are not complete and cannot generate all recursively enumerable languages.
Sergey Verlan +2 more
doaj +1 more source
Adding Matrix Control: Insertion-Deletion Systems with Substitutions III
Insertion-deletion systems have been introduced as a formalism to model operations that find their counterparts in ideas of bio-computing, more specifically, when using DNA or RNA strings and biological mechanisms that work on these strings.
Martin Vu, Henning Fernau
doaj +1 more source
On Parsing Programming Languages with Turing-Complete Parser
A new parsing method based on the semi-Thue system is described. Similar to, but with more efficient implementation than Markov normal algorithms, it can be used for parsing any recursively enumerable language.
BoĊĦtjan Slivnik, Marjan Mernik
doaj +1 more source
Partial Learning of Recursively Enumerable Languages [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ziyuan Gao +2 more
openaire +4 more sources

