The complementation problem for nondeterministic word automata has numerous applications in formal verification. In particular, the language-containment problem, to which many verification problems is reduced, involves complementation. For automata on finite words, which correspond to safety properties, complementation involves determinization
Automata on infinite words (omega-automata) have wide applications in formal language theory as well...
We compare the nondeterministic state complexity of unary regular languages and that of their comple...
Abstract. Checking whether one formal language is included in another is vital to many verification ...
The complementation problem for nondeterministic word automata has numerous applications in formal v...
Abstract. The complementation problem for nondeterministic word au-tomata has numerous applications ...
We follow a connection between tight determinisation and complementation and establish a complementa...
Complementation and determinization are two fundamental notions in automata the-ory. The close relat...
AbstractIn the automata-theoretic approach to model checking we check the emptiness of the product o...
Computation is employed to incredible success in a massive variety of applications, and yet it is di...
Complementation of finite automata on infinite words is not only a fundamental problem in automata t...
Determinisation and complementation are foundational notions in computer science. When considering f...
Complementation of finite automata on infinite words is not only a fundamental problem in automata t...
In this paper, we first introduce a lower bound technique for the statecomplexity of transformations...
Automata on infinite words (ω-automata) have wide ap-plications in formal language theory as well as...
AbstractWe compare the nondeterministic state complexity of unary regular languages and that of thei...
Automata on infinite words (omega-automata) have wide applications in formal language theory as well...
We compare the nondeterministic state complexity of unary regular languages and that of their comple...
Abstract. Checking whether one formal language is included in another is vital to many verification ...
The complementation problem for nondeterministic word automata has numerous applications in formal v...
Abstract. The complementation problem for nondeterministic word au-tomata has numerous applications ...
We follow a connection between tight determinisation and complementation and establish a complementa...
Complementation and determinization are two fundamental notions in automata the-ory. The close relat...
AbstractIn the automata-theoretic approach to model checking we check the emptiness of the product o...
Computation is employed to incredible success in a massive variety of applications, and yet it is di...
Complementation of finite automata on infinite words is not only a fundamental problem in automata t...
Determinisation and complementation are foundational notions in computer science. When considering f...
Complementation of finite automata on infinite words is not only a fundamental problem in automata t...
In this paper, we first introduce a lower bound technique for the statecomplexity of transformations...
Automata on infinite words (ω-automata) have wide ap-plications in formal language theory as well as...
AbstractWe compare the nondeterministic state complexity of unary regular languages and that of thei...
Automata on infinite words (omega-automata) have wide applications in formal language theory as well...
We compare the nondeterministic state complexity of unary regular languages and that of their comple...
Abstract. Checking whether one formal language is included in another is vital to many verification ...
DOI
Add to ORKG