Jumping Automata for Uniform Strategies

DOI10.4230/LIPICS.FSTTCS.2013.287MaRDI QIDQ2963921zbMATH OpenOpenAlexFDO

Authors Bastien Maubert, Sophie Pinchinat

Publication date 21 February 2017

Full work available at URL https://hal.inria.fr/hal-01098741

zbMATH Keywords

gamesimperfect informationjumping automatauniform strategies

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Applications of game theory (91A80)

Recommendations

• Uniform strategies, rational relations and jumping automata
• Jumping finite automata
• Jumping finite automata: characterizations and complexity
• Characterization and complexity results on jumping finite automata
• On basic properties of jumping finite automata
• Two-way jumping automata
• Jumping automata over Infinite words
• Cyclic Proofs and Jumping Automata
• Operational state complexity and decidability of jumping finite automata
• Operational state complexity and decidability of jumping finite automata

Cited in

(5)

• Enhancement of automata with jumping modes
• Uniform strategies, rational relations and jumping automata
• Relating paths in transition systems: the fall of the modal mu-calculus
• The complexity of synthesizing uniform strategies
• A general notion of uniform strategies

This page was built for publication: Jumping Automata for Uniform Strategies

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