Writing stack acceptors (Q2554233)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Writing stack acceptors	scientific article

Statements

scholarly article

0 references

Writing stack acceptors (English)

0 references

zbMATH Open document ID

0 references

10.1016/S0022-0000(72)80021-7

0 references

Joseph Alphonso Giuliano

0 references

Journal of Computer and System Sciences

0 references

publication date

1972

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

Variations on pushdown machines (Detailed Abstract)

0 references

Studies in abstract families of languages

0 references

0 references

Stack automata and compiling

0 references

Writing stack acceptors

0 references

Two-way pushdown automata

0 references

On the Computational Complexity of Algorithms

0 references

Two-Tape Simulation of Multitape Turing Machines

0 references

0 references

Relations Between Time and Tape Complexities

0 references

Writing pushdown acceptors

0 references

Relationships between nondeterministic and deterministic tape complexities

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2554233

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