Reachability Games on Automatic Graphs
From MaRDI portal
Publication:3073641
DOI10.1007/978-3-642-18098-9_24zbMath1297.68159OpenAlexW1567370363MaRDI QIDQ3073641
Publication date: 11 February 2011
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-18098-9_24
Computational learning theory (68Q32) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Games on graphs (graph-theoretic aspects) (05C57)
Related Items
Uses Software
Cites Work
- Learning regular sets from queries and counterexamples
- Finite presentations of infinite structures: Automata and interpretations
- Concurrent reachability games
- Regular Model Checking using Widening Techniques
- Tools and Algorithms for the Construction and Analysis of Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Reachability Games on Automatic Graphs