Automatentheorie und Logik

DOI10.1007/978-3-642-18090-3zbMath1257.68003OpenAlexW1654346288WikidataQ47882486 ScholiaQ47882486MaRDI QIDQ3083622

Martin Hofmann, Martin Lange

Publication date: 22 March 2011

Published in: eXamen.press (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18090-3

zbMATH Keywords

parity gamesdecision problemsmonadic second-order logicdecidabilityfinite automatatemporal logicformal languagestree automataBüchi automatainfinite wordsmodal \(\mu\)-calculustree languagesinfinite treesfinite treesEhrenfeucht-Fraïssé gamesalternating automataparity automatafinite wordsMuller automataRabin automataStreett automata

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Temporal logic (03B44)

Related Items (2)

Regular language representations in the constructive type theory of Coq ⋮ Valuations of Weighted Automata: Doing It in a Rational Way

This page was built for publication: Automatentheorie und Logik