Sciweavers

DLT
2003
13 years 5 months ago
NFA Reduction Algorithms by Means of Regular Inequalities
We present different techniques for reducing the number of states and transitions in nondeterministic automata. These techniques are based on the two preorders over the set of st...
Jean-Marc Champarnaud, Fabien Coulon
DAGSTUHL
2006
13 years 5 months ago
An Algorithm for Matching Nondeterministic Services with Operating Guidelines
Interorganizational cooperation is more and more organized by the paradigm of services. Service-oriented architectures (SOA) provide a general framework for service interaction. SO...
Peter Massuthe, Karsten Wolf
ATVA
2006
Springer
121views Hardware» more  ATVA 2006»
13 years 7 months ago
On the Succinctness of Nondeterminism
Abstract. Much is known about the differences in expressiveness and succinctness between nondeterministic and deterministic automata on infinite words. Much less is known about the...
Benjamin Aminof, Orna Kupferman
FSTTCS
2009
Springer
13 years 10 months ago
On Nondeterministic Unranked Tree Automata with Sibling Constraints
ABSTRACT. We continue the study of bottom-up unranked tree automata with equality and disequality constraints between direct subtrees. In particular, we show that the emptiness pro...
Christof Löding, Karianto Wong