scientific article; zbMATH DE number 5033837

zbMATH Open1136.91345MaRDI QIDQ5472876FDOQ5472876

Olivier Finkel

Publication date: 19 June 2006

Full work available at URL: http://iospress.metapress.com/content/n2j4vhk688l6rm0h/fulltext.pdf

Title of this publication is not available (Why is that?)

zbMATH Keywords

Borel complexityPushdown automatapushdown gameswinning conditionsclosure under Boolean operationscontext free \(\omega\)-languagesinfinite two-player gamesset of winning positions

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Games involving topology, set theory, or logic (91A44) Descriptive set theory (03E15)

Cited In (5)

• Automata, Languages and Programming
• On winning Ehrenfeucht games and monadic NP
• Winning Regions of Pushdown Parity Games: A Saturation Method
• Title not available (Why is that?)
• Games with winning conditions of high Borel complexity

This page was built for publication:

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