Sciweavers

500 search results - page 7 / 100
» Streaming tree automata
Sort
View
CALCO
2009
Springer
176views Mathematics» more  CALCO 2009»
14 years 2 months ago
Complementation of Coalgebra Automata
Abstract. Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This...
Christian Kissig, Yde Venema
ENTCS
2006
161views more  ENTCS 2006»
13 years 7 months ago
Algebraic Specification and Coalgebraic Synthesis of Mealy Automata
We introduce the notion of functional stream derivative, generalising the notion of input derivative of rational expressions (Brzozowski 1964) to the case of stream functions over...
Jan J. M. M. Rutten
FOCS
2005
IEEE
14 years 1 months ago
Safraless Decision Procedures
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the...
Orna Kupferman, Moshe Y. Vardi
LICS
2007
IEEE
14 years 1 months ago
A Contraction Method to Decide MSO Theories of Deterministic Trees
In this paper we generalize the contraction method, originally proposed by Elgot and Rabin and later extended by Carton and Thomas, from labeled linear orderings to colored determ...
Angelo Montanari, Gabriele Puppis
IANDC
2007
126views more  IANDC 2007»
13 years 7 months ago
Alternating two-way AC-tree automata
We explore the notion of alternating two-way tree automata modulo the theory of finitely many associative-commutative (AC) symbols. This was prompted by questions arising in cryp...
Kumar Neeraj Verma, Jean Goubault-Larrecq