Walter Savitch

Available identifiers

zbMath Open savitch.walter-jDBLPs/WalterJSavitchWikidataQ92656 ScholiaQ92656MaRDI QIDQ794170

List of research outcomes

Publication	Date of Publication	Type
Deterministic simulation of non-deterministic turing machines (Detailed Abstract)	2014-03-14	Paper
The Software Side of Computer Science – Computer Programming	2014-02-21	Paper
https://portal.mardi4nfdi.de/entity/Q4527060	2001-10-21	Paper
Problem solving with C++. The object of programming.	2001-05-29	Paper
https://portal.mardi4nfdi.de/entity/Q4344034	1997-07-07	Paper
Why it might pay to assume that languages are infinite	1997-05-11	Paper
https://portal.mardi4nfdi.de/entity/Q4855383	1995-11-12	Paper
https://portal.mardi4nfdi.de/entity/Q4325274	1995-03-07	Paper
https://portal.mardi4nfdi.de/entity/Q4003371	1992-09-18	Paper
https://portal.mardi4nfdi.de/entity/Q4725769	1986-01-01	Paper
On the power of real-time two-way multihead finite automata with jumps	1984-01-01	Paper
Consistency in nondeterministic storage	1984-01-01	Paper
A note on relativized log space	1983-01-01	Paper
Parallel random access machines with powerful instruction sets	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3309067	1981-01-01	Paper
Growth functions of stochastic Lindenmayer systems	1980-01-01	Paper
Time Bounded Random Access Machines with Parallel Processing	1979-01-01	Paper
Hierarchies of recursive computations†	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3930620	1979-01-01	Paper
Programs for instruction machines	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4194464	1978-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4160411	1978-01-01	Paper
On inverse deterministic pushdown transductions	1978-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4124336	1977-01-01	Paper
Recursive turing machines †	1977-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4133132	1976-01-01	Paper
Ambiguity in the developmental systems of Lindenmayer	1975-01-01	Paper
The Turing degree of the inherent ambiguity problem for context-free languages	1975-01-01	Paper
Some characterizations of lindenmayer systems in terms of chomsky-type grammars and stack machines	1975-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4072877	1974-01-01	Paper
Maze recognizing automata and nondeterministic tape complexity	1973-01-01	Paper
A note on multihead automata and context-sensitive languages	1973-01-01	Paper
How to Make Arbitrary Grammars Look Like Context-Free Grammars	1973-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4134982	1973-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4131024	1972-01-01	Paper
Relationships between nondeterministic and deterministic tape complexities	1970-01-01	Paper

Research outcomes over time

This page was built for person: Walter Savitch