46 search results - page 3 / 10 » Strategical languages of infinite words |
APAL
2008
13 years 5 months ago
2008
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
FUIN
2010
13 years 2 months ago
2010
An infinite binary word can be identified with a branch in the full binary tree. We consider sets of branches definable in monadic second-order logic over the tree, where we allow ...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its la...
CSL
2008
Springer
13 years 7 months ago
2008
Springer
Infinite-state automata are a new invention: they are automata that have an infinite number of states represented by words, transitions defined using rewriting, and with sets of in...
FOSSACS
2010
Springer
13 years 9 months ago
2010
Springer
We study variants of regular infinite games where the strict alternation of moves between the two players is subject to modifications. The second player may postpone a move for a f...