Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Variants of collapsible pushdown systems

From MaRDI portal
Publication:4649568
Jump to:navigation, search

DOI10.4230/LIPICS.CSL.2012.500zbMATH Open1252.68120OpenAlexW2293153760MaRDI QIDQ4649568FDOQ4649568


Authors: Paweł Parys Edit this on Wikidata


Publication date: 22 November 2012


Full work available at URL: http://frontiersinai.com/turingfiles/September/39.pdf




Recommendations

  • On the significance of the collapse operation
  • Collapsible pushdown automata and recursion schemes
  • Strictness of the collapsible pushdown hierarchy
  • Collapsible Pushdown Graphs of Level 2 are Tree-Automatic
  • Collapsible Pushdown Graphs of Level 2 are Tree-Automatic


zbMATH Keywords

reachabilitydeterminizationinfinite hierarchyshrinking lemmacollapsible pushdown systems


Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)



Cited In (6)

  • A Saturation Method for Collapsible Pushdown Systems
  • Saturation of Concurrent Collapsible Pushdown Systems
  • Strictness of the collapsible pushdown hierarchy
  • On the significance of the collapse operation
  • Collapsible pushdown automata and recursion schemes
  • The Caucal hierarchy: interpretations in the (W)MSO+\(\mathsf{U}\) logic





This page was built for publication: Variants of collapsible pushdown systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649568)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4649568&oldid=18848503"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 16:31. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki