## 13 Citations

The complexity of the membership problem for some extensions of context-free languagest†

- Computer Science, Linguistics
- 1977

It is shown that the following families of languages can be recognized by deterministic multitape Turing machines either in polynomial time or within (log n)2 tape: the context independent developmental (EOL) languages; the simple matrix languages; and the languages generated by derivation restricted state grammars.

Recognition of Deterministic ETOL Languages in Logarathimic Space

- Computer ScienceInf. Control.
- 1977

On deterministic context-free languages, multihead automata, and the power of an auxiliary pushdown store

- Computer ScienceSTOC '76
- 1976

It is shown that an auxiliary pushdown store does, in fact, add some power to some restricted families of log(n)-tape bounded Turing machines with restricted tape alphabets, and it is indicated that every 2k-head nondeterministic finite automation language can be recognized in 0(n3k) steps.

Complexity of E0L Structural Equivalence

- Computer Science, MathematicsRAIRO Theor. Informatics Appl.
- 1995

We show that the EOL structural equivalence problem is logspace hard for deterministic exponential time. Also, we show that this question can be solved in linear space by a synchronized alternating…

The Time and Tape Complexity of Developmental Languages

- Computer ScienceICALP
- 1977

The following results are established:
(1)
EDOL \( \subseteq \) DSPACE (log n)
(2)
EOL \( \subseteq \) DSPACE ((log n)2)
(3)
EDTOL \( \subseteq \) NSPACE (log n)…

Complexity of some problems concerningL systems

- MathematicsMathematical systems theory
- 2005

For each problem and each type of system, both upper and lower bounds on the time or memory required for solution by Turing machines are established.

Complexity of some Problems Concerning L Systems. (Preliminary report)

- Computer Science, Mathematics
- 1976

Two following papers (PB-69 and PB70) will contain detailed constructions and proofs for the upper and lower bounds on the time or memory required for solution by Turing machines.

Pattern Selector Grammars and Several Parsing Algorithms in the Context-Free Style

- Computer ScienceJ. Comput. Syst. Sci.
- 1985

On the Separating Power of Eol Systems

- Computer Science, MathematicsRAIRO Theor. Informatics Appl.
- 1983

. — A word is called a pure square ifit is oftheform yy where y is a nonempty word; it is called a square ifit contains a pure square — otherwise it is cfl/Zedsquare-free. A language K séparâtes…

## References

SHOWING 1-10 OF 18 REFERENCES

Memory bounds for recognition of context-free and context-sensitive languages

- Computer ScienceSWCT
- 1965

This paper investigates the computational complexity of binary sequences as measured by the rapidity of their generation by multitape Turing machines. A "translational" method which escapes some of…

MACROS, Iterated Substitution and Lindenmayer AFLs

- Mathematics
- 1973

The notion of a K-iteration grammar, where K is a family of languages, provides a uniform framework for discussing the various language families obtained by context-free Lindenmayer systems. It is…

Path systems and language recognition

- Computer ScienceSTOC
- 1970

The main result, theorem 2, gives a bound on the storage required for a Turing machine to simulate certain time-bounded pushdown machines and the Theorem of Savitch stating that a non-deterministic L(n) - storage bounded Turing machine can be simulated by a deterministic (L(n))2 - storage bound Turing machine.

Formal languages and their relation to automata

- Computer ScienceAddison-Wesley series in computer science and information processing
- 1969

The theory of formal languages as a coherent theory is presented and its relationship to automata theory is made explicit, including the Turing machine and certain advanced topics in language theory.

Recognition and Parsing of Context-Free Languages in Time n^3

- Computer ScienceInf. Control.
- 1967

Relationships Between Nondeterministic and Deterministic Tape Complexities

- Computer ScienceJ. Comput. Syst. Sci.
- 1970

Developmental systems without cellular interactions, their languages and grammars.

- Computer ScienceJournal of theoretical biology
- 1971

A Decomposition Theorem for Hyper-Algebraic Extensions of Language Families

- MathematicsTheor. Comput. Sci.
- 1976

The Theory of Parsing, Translation, and Compiling

- Computer Science
- 1972

It is the hope that the algorithms and concepts presented in this book will survive the next generation of computers and programming languages, and that at least some of them will be applicable to fields other than compiler writing.