Homomorphic characterizations of recursively enumerable languages with very small language classes
Satoshi Okawa,Sadaki Hirose +1 more
TLDR
This paper attempts to characterize the class of recursively enumerable languages with much smaller language classes than that of linear languages with the result that the follwing statement is obtained.About:
This article is published in Theoretical Computer Science.The article was published on 2001-01-06 and is currently open access. It has received 8 citations till now. The article focuses on the topics: Cone (formal languages) & Recursively enumerable language.read more
Citations
More filters
Journal ArticleDOI
Languages and Machines: An Introduction to the Theory of Computer Science
TL;DR: The third edition, to summarize the author, adds examples, expands the selection of topics, and provides more flexibility to the instructor in the design of a course.
Journal Article
One-Turn Regulated Pushdown Automata and Their Reduction
Alexander Meduna,Dušan Kolář +1 more
TL;DR: One-turn regulated pushdown automata are studied and it is proved that they characterize the family of recursively enumerable languages and that this characterization holds even for atomic one-turnregulated pushdown Automata of a reduced size.
Dissertation
A study on biologically inspired models of computation
TL;DR: “molecular computing” and “DNA computing’ as computing by using the properties of macromolecules and DNA molecules, respectively” are referred to.
Journal ArticleDOI
Regulated Nondeterminism in Pushdown Automata: The Non-Regular Case
TL;DR: It is proved that if the control language is linear and non-regular, then the power of pushdown automata regulated in this way is increased to thePower of Turing machines.
Regulated Nondeterminism in PDAs: The Non-Regular Case
TL;DR: It is proved that if the control language is linear and non-regular, then the computational power of pushdown automata regulated in this way is increased to the power of Turing machines.
References
More filters
Journal ArticleDOI
Reversal-bounded multipushdown machines
Brenda S. Baker,Ronald V. Book +1 more
TL;DR: Several representations of the recursively enumerable (r.e.) sets are presented and it is shown that this automata theoretic representation cannot be strengthened by restricting the acceptors to be deterministic multitape, nondeterministic one-tape, or nondetergetic multicounter acceptors.
Journal ArticleDOI
One-way stack automata
TL;DR: A number of operations which either preserve sets accepted by one-way stack automata or preserve setsaccepted by deterministic one- way stack Automata are presented.
Book
Languages and Machines: An Introduction to the Theory of Computer Science
TL;DR: A presentation of the theory of computing, including coverage of the Theory of formal languages and automata, compatability, computational complexity, and deterministic parsing of context-free languages.
Journal ArticleDOI
Languages and Machines: An Introduction to the Theory of Computer Science
TL;DR: The third edition, to summarize the author, adds examples, expands the selection of topics, and provides more flexibility to the instructor in the design of a course.
Related Papers (5)
A homomorphic characterization of time and space complexity classes of languages
K. Cullik,N.D. Diamond +1 more