16 search results - page 1 / 4 » On Transition Minimality of Bideterministic Automata |
DLT
2007
13 years 6 months ago
2007
FOSSACS
2012
Springer
12 years 20 days ago
2012
Springer
Coalgebra offers a unified theory of state based systems, including infinite streams, labelled transition systems and deterministic automata. In this paper, we use the coalgebrai...
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We study bisimulation and minimization for weighted automata, relying on a geometrical representation of the model, linear weighted automata (lwa). In a lwa, the state-sp...
TAMC
2007
Springer
13 years 11 months ago
2007
Springer
A word w is called synchronizing (recurrent, reset, directable) word of deterministic finite automaton (DFA) if w brings all states of the automaton to an unique state. ˇCerny co...
IJFCS
2007
13 years 4 months ago
2007
We extend an algorithm by Paige and Tarjan that solves the coarsest stable refinement problem to the domain of trees. The algorithm is used to minimize non-deterministic tree auto...