Stack languages and log n space (Q1250712)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Stack languages and log n space	scientific article

Statements

scholarly article

0 references

Stack languages and log n space (English)

0 references

zbMATH Open document ID

0 references

10.1016/0022-0000(78)90010-7

0 references

0 references

Journal of Computer and System Sciences

0 references

publication date

1978

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/0022-0000(78)90010-7

0 references

0 references

Nested Stack Automata

0 references

Translational lemmas, polynomial time, and \((\log n)^j\)-space

0 references

Quasi-realtime languages

0 references

Stack automata and compiling

0 references

One-way stack automata

0 references

Checking automata and one-way stack languages

0 references

Sets accepted by one-way stack automata are context sensitive

0 references

0 references

Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata

0 references

On two-way multihead automata

0 references

Language recognition by marking automata

0 references

Relationships between nondeterministic and deterministic tape complexities

0 references

On tape-bounded complexity classes and multihead finite automata

0 references

0 references

Rudimentary relations and stack languages

0 references

Deterministic stack automata and the quotient operator

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1250712

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