Multi-stack-counter languages (Q5637896)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 3364807

Language	Label	Description	Also known as
English	Multi-stack-counter languages	scientific article; zbMATH DE number 3364807

Statements

scholarly article

0 references

Multi-stack-counter languages (English)

0 references

0 references

Seymour Ginsburg

0 references

Mathematical Systems Theory

0 references

publication date

1972

0 references

MaRDI profile type

MaRDI publication profile

0 references

Quasi-realtime languages

0 references

Turing machines with restricted memory access

0 references

Counter machines and counter languages

0 references

0 references

One-way stack automata

0 references

Studies in abstract families of languages

0 references

On the closure of AFL under reversal

0 references

The equivalence of stack-counter acceptors and quasi-realtime stack- counter acceptors

0 references

Scattered context grammars

0 references

On the Computational Complexity of Algorithms

0 references

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

0 references

Intercalation theorems for stack languages

0 references

full work available at URL

https://doi.org/10.1007/bf01706072

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/BF01706072

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5637896

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