Skip to Main content Skip to Navigation
Conference papers

Unsafe grammars and panic automata

Abstract : We show that the problem of checking if an infinite tree gen- erated by a higher-order grammar of level 2 (hyperalgebraic) satisfies a given µ-calculus formula (or, equivalently, if it is accepted by an al- ternating parity automaton) is decidable, actually 2-Exptime-complete. Consequently, the monadic second-order theory of any hyperalgebraic tree is decidable, so that the safety restriction can be removed from our previous decidability result. The last result has been independently obtained by Aehlig, de Miranda and Ong. Our proof goes via a char- acterization of possibly unsafe second-order grammars by a new variant of higher-order pushdown automata, which we call panic automata. In addition to the standard pop 1 and pop 2 operations, these automata have an option of a destructive move called panic . The model-checking prob- lem is then reduced to the problem of deciding the winner in a parity game over a suitable 2nd order pushdown system.
Document type :
Conference papers
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Igor Walukiewicz <>
Submitted on : Thursday, October 30, 2008 - 1:37:57 PM
Last modification on : Thursday, September 9, 2021 - 3:32:14 AM
Long-term archiving on: : Tuesday, October 9, 2012 - 2:42:02 PM


Files produced by the author(s)


  • HAL Id : hal-00335729, version 1



Teodor Knapik, Damian Niwinski, Pawel Urzyczyn, Igor Walukiewicz. Unsafe grammars and panic automata. ICALP'05, 2005, Lisbonne, Portugal. pp.1450--1461. ⟨hal-00335729⟩



Record views


Files downloads