Empty alternation (Q5096908)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7573212

Language	Label	Description	Also known as
English	Empty alternation	scientific article; zbMATH DE number 7573212

Statements

scholarly article

0 references

Empty alternation (English)

0 references

Klaus Reinhardt

0 references

Klaus-Joern Lange

0 references

Mathematical Foundations of Computer Science 1994

0 references

publication date

18 August 2022

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/3-540-58338-6_96

0 references

0 references

0 references

Two Applications of Inductive Counting for Complementation Problems

0 references

0 references

Characterizations of Pushdown Machines in Terms of Time-Bounded Computers

0 references

0 references

Nondeterministic Space is Closed under Complementation

0 references

Characterizing the polynomial hierarchy by alternating auxiliary pushdown automata

0 references

The logarithmic alternation hierarchy collapses: \(A\Sigma _ 2^{{\mathcal L}}=A\Pi_ 2^{{\mathcal L}}\)

0 references

Relativization of questions about log space computability

0 references

Alternation bounded auxiliary pushdown automata

0 references

0 references

A grammatical characterization of alternating pushdown automata

0 references

0 references

Space-bounded hierarchies and probabilistic computations

0 references

0 references

On the Tape Complexity of Deterministic Context-Free Languages

0 references

Bounded Query Classes

0 references

Properties that characterize LOGCFL

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/3-540-58338-6_96

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5096908

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