Journal ArticleDOI
Formal Languages and their Relation to Automata
About:
This article is published in Nuclear Science and Engineering.The article was published on 1970-05-01. It has received 84 citations till now. The article focuses on the topics: Abstract family of languages & Automata theory.read more
Citations
More filters
Journal ArticleDOI
Relationships between nondeterministic and deterministic tape complexities
TL;DR: The amount of storage needed to simulate a nondeterministic tape bounded Turingmachine on a deterministic Turing machine is investigated and a specific set is produced, namely the set of all codings of threadable mazes, such that, if there is any set which distinguishes nondeter microscopic complexity classes from deterministic tape complexity classes, then this is one such set.
Journal ArticleDOI
Physical Symbol Systems
TL;DR: In this paper, the nature of physical symbol systems is laid out in ways familiar, but not thereby useless, to review the basis of common understanding between the various disciplines.
Journal ArticleDOI
Computable queries for relational data bases
Ashok K. Chandra,David Harel +1 more
TL;DR: The main result is the completeness of a simple programming language which can be thought of as consisting of the relational algebra augmented with the power of iteration.
Journal ArticleDOI
Reversal-Bounded Multicounter Machines and Their Decision Problems
TL;DR: It is shown that the emptiness, infiniteness, dlsjointness, containment, universe, and equivalence problems are decidable for the class of deterministic two-way multlcounter machines whose input and counters are reversal-bounded.
Journal ArticleDOI
On Time Versus Space
TL;DR: The context-sensitive languages cannot be recognized in linear time by deterministic multitape Turing machines, and are strictly contained in the class of languages recognized by Turing machines of tape complexity.
References
More filters
Journal ArticleDOI
Relationships between nondeterministic and deterministic tape complexities
TL;DR: The amount of storage needed to simulate a nondeterministic tape bounded Turingmachine on a deterministic Turing machine is investigated and a specific set is produced, namely the set of all codings of threadable mazes, such that, if there is any set which distinguishes nondeter microscopic complexity classes from deterministic tape complexity classes, then this is one such set.
Journal ArticleDOI
Physical Symbol Systems
TL;DR: In this paper, the nature of physical symbol systems is laid out in ways familiar, but not thereby useless, to review the basis of common understanding between the various disciplines.
Journal ArticleDOI
Computable queries for relational data bases
Ashok K. Chandra,David Harel +1 more
TL;DR: The main result is the completeness of a simple programming language which can be thought of as consisting of the relational algebra augmented with the power of iteration.
Journal ArticleDOI
Reversal-Bounded Multicounter Machines and Their Decision Problems
TL;DR: It is shown that the emptiness, infiniteness, dlsjointness, containment, universe, and equivalence problems are decidable for the class of deterministic two-way multlcounter machines whose input and counters are reversal-bounded.
Journal ArticleDOI
On Time Versus Space
TL;DR: The context-sensitive languages cannot be recognized in linear time by deterministic multitape Turing machines, and are strictly contained in the class of languages recognized by Turing machines of tape complexity.