Automata, Languages and Programming
DOI10.1007/11523468zbMath1081.68054WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716767
Igor Walukiewicz, Paweł Urzyczyn, Teodor Knapik, Damian Niwinski
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
verification; \(\mu\)-calculus; decidability; model-checking; monadic second-order theory; parity game; higher-order pushdown automata; hyperalgebraic tree; higher-order grammar
91A80: Applications of game theory
68Q45: Formal languages and automata
03D05: Automata and formal grammars in connection with logical questions
68Q60: Specification and verification (program logics, model checking, etc.)
03B25: Decidability of theories and sets of sentences
68Q42: Grammars and rewriting systems
Related Items