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. The 2 blow-up that is caused by the subset constru...

We present a tool that transforms nondeterministic ω-automata to semi-deterministic ω-automata. The tool Seminator accepts transition-based generalized Büchi automata (TGBA) as an input and produces automata with two kinds of semi-determinism. The implemented procedure performs degeneralization and semi-determinization simultaneously and employs several other optimizations. We experimentally ev...

This paper provides a solution to the mandatory transformation example specified in MOLA – a graphical model transformation language developed at the University of Latvia. The solution is validated by executing it via the MOLA execution environment on several examples. In addition, a solution to one of the optional examples – determinization of a nondeterministic automaton is provided.

It has remained an open question whether the twins property for weighted tree automata is decidable. This property is crucial for determinizing such an automaton, and it has been argued that determinization improves the output of parsers and translation systems. We show that the twins property for weighted tree automata over extremal semifields is decidable.

This paper discusses determinization of conditional term rewriting systems with oriented constructor rules. We present a rule-based transformation system, which transforms a non-deterministic one into a deterministic one, together with examples of the transformation. We prove that the transformation system is simulation sound and simulation complete. We also prove that the transformation system...

The powerset construction is a standard method for converting a nondeterministic automaton into a deterministic one recognizing the same language. In this paper, we lift the powerset construction from automata to the more general framework of coalgebras with structured state spaces. Coalgebra is an abstract framework for the uniform study of different kinds of dynamical systems. An endofunctor ...

This paper describes the FSA Utilities toolbox: a collection of utilities to manipulate nite-state automata and nite-state transducers. Manipulations include determinization (both for nite-state accep-tors and nite-state transducers), minimization, composition, comple-mentation, intersection, Kleene closure, etc. Furthermore, various visu-alization tools are available to browse nite-state autom...

4.0 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 199 4.1 Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 200 4.2 Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 201 4.2.1 Composition . . . . . . . . . . . . . . . . . . . . . . . . . 201 4.2.2 Determinization . . . . . . . . . . . . . . . . . . . . . . . 206 4.2.3 Weight pu...

We consider weighted tree automata over strong bimonoids which are, roughly speaking, semirings without distributivity. We prove sufficient and necessary conditions under which the initial algebra semantics and the run semantics of these automata coincide. We prove closure properties of the class of recognizable tree series, a determinization result, and a characterization of recognizable step ...