Automatentheorie und Logik

DOI10.1007/978-3-642-18090-3zbMath1257.68003WikidataQ47882486 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 games; decision problems; monadic second-order logic; decidability; finite automata; temporal logic; formal languages; tree automata; Büchi automata; infinite words; modal \(\mu\)-calculus; tree languages; infinite trees; finite trees; Ehrenfeucht-Fraïssé games; alternating automata; parity automata; finite words; Muller automata; Rabin automata; Streett automata

Mathematics Subject Classification ID

68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science

68Q45: Formal languages and automata

03-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations

03B70: Logic in computer science

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

68-02: Research exposition (monographs, survey articles) pertaining to computer science

03B44: Temporal logic

Related Items

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