Emptiness of Multi-pushdown Automata Is 2ETIME-Complete (Q3533004): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-85780-8_9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1603445208 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emptiness of Multi-pushdown Automata Is 2ETIME-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability analysis of pushdown automata: Application to model-checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated stack automata and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-Bounded Analysis of Concurrent Queue Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Infinite Automaton Characterization of Double Exponential Time / rank
 
Normal rank

Latest revision as of 19:23, 28 June 2024

scientific article
Language Label Description Also known as
English
Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
scientific article

    Statements