76 search results - page 13 / 16 » Weak Alternating Automata and Tree Automata Emptiness |
139
click to vote
LPAR
2005
Springer
15 years 11 months ago
2005
Springer
We present an algorithm for the conversion of very weak alternating Büchi automata into nondeterministic Büchi automata (NBA), and we introduce a local optimization criterion fo...
184
click to vote
LICS
1997
IEEE
15 years 9 months ago
1997
IEEE
Fixpoint expressions built from functional signatures interpreted over arbitrary complete lattices are considered. A generic notionof automatonis defined and shown, by means of a ...
146
click to vote
CAV
1999
Springer
15 years 10 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
172
click to vote
ASE
2002
15 years 5 months ago
2002
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
147
click to vote
ESOP
2009
Springer
15 years 9 months ago
2009
Springer
We describe the mechanisation of SLR parsing, covering background properties of context-free languages and grammars, as well as the construction of an SLR automaton. Among the vari...