output
20062021
most citedModel-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable

77 citations

researchers with a paper here
collaborating institutions
Showing 2008Show all

1 paper · 1 filter

cs.LO2008★ 10 cited

An Application of the Feferman-Vaught Theorem to Automata and Logics for<br> Words over an Infinite Alphabet

Alexis Bès

We show that a special case of the Feferman-Vaught composition theorem gives rise to a natural notion of automata for finite words over an infinite alphabet, with good closure and…