Results 1  10
of
237
Extending Automated Compositional Verification to the Full Class of OmegaRegular Languages
, 2008
"... Recent studies have suggested the applicability of learning to automated compositional verification. However, current learning algorithms fall short when it comes to learning liveness properties. We extend the automaton synthesis paradigm for the infinitary languages by presenting an algorithm to le ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
to learn an arbitrary regular set of infinite sequences (an ωregular language) over an alphabet Σ. Our main result is an algorithm to learn a nondeterministic Büchi automaton that recognizes an unknown ωregular language. This is done by learning a unique projection of it on Σ ∗ using the framework
OmegaRegular Halfpositional Winning Conditions
"... Abstract. We study infinite games where one of the players always has a positional (memoryless) winning strategy, while the other player may use a historydependent strategy. We investigate winning conditions which guarantee such a property for all arenas, or all finite arenas. Our main result is t ..."
Abstract
 Add to MetaCart
is that this property is decidable in single exponential time for a given prefix independent ωregular winning condition. We also exhibit a big class of winning conditions (XPS) which has this property. Key words: automata, infinite games, omegaregular languages, positional strategies, winning condtions 1
Alphabets
"... Abstract. We examine the class of languages over countably infinite alphabets characterized by a class of restricted and simplified P automata variants, which we call P finite automata, and show that these classes possess several properties which make them perfect candidates for being the natural ex ..."
Abstract
 Add to MetaCart
Abstract. We examine the class of languages over countably infinite alphabets characterized by a class of restricted and simplified P automata variants, which we call P finite automata, and show that these classes possess several properties which make them perfect candidates for being the natural
Graph reachability and pebble automata over infinite alphabets
 In LICS’09
"... Abstract—We study the graph reachability problem as a language over an infinite alphabet. Namely, we view a word of even length a0b0 ···anbn over an infinite alphabet as a directed graph with the symbols that appear in a0b0 ···anbn as the vertices and (a0,b0),...,(an,bn) as the edges. We prove that ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
Abstract—We study the graph reachability problem as a language over an infinite alphabet. Namely, we view a word of even length a0b0 ···anbn over an infinite alphabet as a directed graph with the symbols that appear in a0b0 ···anbn as the vertices and (a0,b0),...,(an,bn) as the edges. We prove
5 ωCFL which are Borel of infinite rank 12
"... This paper is a continuation of the study of topological properties of omega context free languages (ωCFL). We proved in [Topological Properties of Omega Context Free Languages, Theoretical Computer Science, Volume 262 (12), 2001, p. 669697] that the class of ωCFL exhausts the finite ranks of th ..."
Abstract
 Add to MetaCart
This paper is a continuation of the study of topological properties of omega context free languages (ωCFL). We proved in [Topological Properties of Omega Context Free Languages, Theoretical Computer Science, Volume 262 (12), 2001, p. 669697] that the class of ωCFL exhausts the finite ranks
An Application of the FefermanVaught Theorem to Automata and Logics for Words over an Infinite Alphabet
, 2007
"... Abstract We show that a special case of the FefermanVaught composition theorem gives rise to a natural notion of automata for finite words over an infinite alphabet, with good closure and decidability properties, as well as several logical characterizations. We also consider a slight extension of t ..."
Abstract
 Add to MetaCart
Abstract We show that a special case of the FefermanVaught composition theorem gives rise to a natural notion of automata for finite words over an infinite alphabet, with good closure and decidability properties, as well as several logical characterizations. We also consider a slight extension
On a Class of P Automata as a Machine Model for Languages over Infinite Alphabets
"... We show how P automata having a finite description and working with a finite objectalphabet can be used to describe languages over countably infinite alphabets. We propose to relate the language classes characterized by different types of P automata to some of the existing characterizations of lang ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We show how P automata having a finite description and working with a finite objectalphabet can be used to describe languages over countably infinite alphabets. We propose to relate the language classes characterized by different types of P automata to some of the existing characterizations
LEARNING REGULAR LANGUAGES OVER LARGE ORDERED ALPHABETS
"... Abstract. This work is concerned with regular languages defined over large alphabets, either infinite or just too large to be expressed enumeratively. We define a generic model where transitions are labeled by elements of a finite partition of the alphabet. We then extend Angluin’s L ∗ algorithm for ..."
Abstract
 Add to MetaCart
Abstract. This work is concerned with regular languages defined over large alphabets, either infinite or just too large to be expressed enumeratively. We define a generic model where transitions are labeled by elements of a finite partition of the alphabet. We then extend Angluin’s L ∗ algorithm
The FO² alternation hierarchy is decidable
, 2012
"... We consider the twovariable fragment FO²[<] of firstorder logic over finite words. Numerous characterizations of this class are known. Thérien and Wilke have shown that it is decidable whether a given regular language is definable in FO²[<]. From a practical point of view, as shown by Weis, ..."
Abstract
 Add to MetaCart
We consider the twovariable fragment FO²[<] of firstorder logic over finite words. Numerous characterizations of this class are known. Thérien and Wilke have shown that it is decidable whether a given regular language is definable in FO²[<]. From a practical point of view, as shown by Weis
BOUNDEDNESS IN LANGUAGES OF INFINITE WORDS
"... We define a new class of languages of ωwords, strictly extending ωregular languages. One way to present this new class is by a type of regular expressions. The new expressions are an extension of ωregular expressions where two new variants of the Kleene star L ∗ are added: L B and L S. These ne ..."
Abstract
 Add to MetaCart
We define a new class of languages of ωwords, strictly extending ωregular languages. One way to present this new class is by a type of regular expressions. The new expressions are an extension of ωregular expressions where two new variants of the Kleene star L ∗ are added: L B and L S
Results 1  10
of
237