116 search results - page 9 / 24 » Minimization of Automata |
CONCUR
2009
Springer
15 years 4 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...
CPAIOR
2009
Springer
15 years 4 months ago
2009
Springer
An attractive mechanism to specify global constraints in rostering and other domains is via formal languages. For instance, the REGULAR and GRAMMAR constraints specify constraints ...
HYBRID
2009
Springer
15 years 4 months ago
2009
Springer
We show that regarding finite automata (FA) as discrete, time-invariant linear systems over semimodules, allows to: (1) express FA minimization and FA determinization as particula...
116
click to vote
IPL
2008
14 years 10 months ago
2008
Abstract. We establish linear-time reductions between the minimization of a deterministic finite automaton (DFA) and the conjunction of 3 subproblems: the minimization of a strongl...
WIA
2000
Springer
15 years 1 months ago
2000
Springer
We have implemented a package that transforms concise algebraic descriptions of linear block codes into finite automata representations, and also generates decoders from such repre...