Program Schemes with Deep Pushdown Storage (Q3507414)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Program Schemes with Deep Pushdown Storage	scientific article

Statements

scholarly article

0 references

Program Schemes with Deep Pushdown Storage (English)

0 references

Iain A. Stewart

0 references

Argimiro A. Arratia

0 references

Logic and Theory of Algorithms

0 references

publication date

19 June 2008

0 references

full work available at URL

http://dro.dur.ac.uk/5770/1/5770.pdf

0 references

MaRDI profile type

MaRDI publication profile

0 references

On the power of deep pushdown stacks

0 references

Hierarchies in classes of program schemes

0 references

On Classes of Program Schemata

0 references

Characterizations of Pushdown Machines in Terms of Time-Bounded Computers

0 references

0 references

0 references

On static logics, dynamic logics, and complexity classes

0 references

Even Simple Programs Are Hard To Analyze

0 references

A hierarchy between context-free and context-sensitive languages

0 references

Deep pushdown automata

0 references

Using the Hamiltonian path operator to capture NP

0 references

Program schemes, arrays, Lindström quantifiers and zero-one laws

0 references

Using Program Schemes to Capture Polynomial-Time Logically on Certain Classes of Structures

0 references

Some relationships between logics of programs and complexity theory

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-540-69407-6_2

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3507414

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