Walter J. Savitch

From MaRDI portal
Person:794170

Available identifiers

zbMath Open savitch.walter-jWikidataQ92656 ScholiaQ92656MaRDI QIDQ794170

List of research outcomes

PublicationDate of PublicationType
Deterministic simulation of non-deterministic turing machines (Detailed Abstract)2014-03-14Paper
The Software Side of Computer Science – Computer Programming2014-02-21Paper
https://portal.mardi4nfdi.de/entity/Q45270602001-10-21Paper
https://portal.mardi4nfdi.de/entity/Q27158142001-05-29Paper
https://portal.mardi4nfdi.de/entity/Q43440341997-07-07Paper
Why it might pay to assume that languages are infinite1997-05-11Paper
https://portal.mardi4nfdi.de/entity/Q48553831995-11-12Paper
https://portal.mardi4nfdi.de/entity/Q43252741995-03-07Paper
https://portal.mardi4nfdi.de/entity/Q40033711992-09-18Paper
https://portal.mardi4nfdi.de/entity/Q47257691986-01-01Paper
On the power of real-time two-way multihead finite automata with jumps1984-01-01Paper
Consistency in nondeterministic storage1984-01-01Paper
A note on relativized log space1983-01-01Paper
Parallel random access machines with powerful instruction sets1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33090671981-01-01Paper
Growth functions of stochastic Lindenmayer systems1980-01-01Paper
Hierarchies of recursive computations†1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39306201979-01-01Paper
Time Bounded Random Access Machines with Parallel Processing1979-01-01Paper
Programs for instruction machines1979-01-01Paper
On inverse deterministic pushdown transductions1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41604111978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41944641978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41243361977-01-01Paper
Recursive turing machines †1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41331321976-01-01Paper
The Turing degree of the inherent ambiguity problem for context-free languages1975-01-01Paper
Ambiguity in the developmental systems of Lindenmayer1975-01-01Paper
Some characterizations of lindenmayer systems in terms of chomsky-type grammars and stack machines1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40728771974-01-01Paper
Maze recognizing automata and nondeterministic tape complexity1973-01-01Paper
A note on multihead automata and context-sensitive languages1973-01-01Paper
How to Make Arbitrary Grammars Look Like Context-Free Grammars1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41349821973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41310241972-01-01Paper
Relationships between nondeterministic and deterministic tape complexities1970-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Walter J. Savitch