Multitape one-way nonwriting automata (Q2527943)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Multitape one-way nonwriting automata	scientific article

Statements

scholarly article

0 references

Multitape one-way nonwriting automata (English)

0 references

zbMATH Open document ID

0 references

10.1016/S0022-0000(68)80028-5

0 references

Journal of Computer and System Sciences

0 references

publication date

1968

0 references

zbMATH DE Number

0 references

zbMATH Keywords

mathematical logic

0 references

Patrick C. Fischer

0 references

Arnold L. Rosenberg

0 references

MaRDI profile type

MaRDI publication profile

0 references

A Machine-Independent Theory of the Complexity of Recursive Functions

0 references

On Formalisms for Turing Machines

0 references

Turing machines with a schedule to keep

0 references

Tape-reversal bounded Turing machine computations

0 references

On the Computational Complexity of Algorithms

0 references

One-tape, off-line Turing machine computations

0 references

0 references

full work available at URL

https://doi.org/10.1016/s0022-0000(68)80028-5

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2527943

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2527943&oldid=37418605"