Pushdown automata with counters (Q2554231)

From MaRDI portal

Revision as of 10:32, 12 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Pushdown automata with counters	scientific article

Statements

scholarly article

0 references

Pushdown automata with counters (English)

0 references

0 references

Journal of Computer and System Sciences

0 references

publication date

1972

0 references

MaRDI profile type

MaRDI publication profile

0 references

Time and tape complexity of pushdown automaton languages

0 references

On the computational power of pushdown automata

0 references

Characterizations of Pushdown Machines in Terms of Time-Bounded Computers

0 references

0 references

Turing machines with restricted memory access

0 references

Counter machines and counter languages

0 references

Two-way pushdown automata

0 references

Multi-tape and multi-head pushdown automata

0 references

0 references

Note on tape reversal complexity of languages

0 references

Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines

0 references

Recognition and parsing of context-free languages in time n3

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/S0022-0000(72)80019-9

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2554231

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