233 search results - page 5 / 47 » Equivalent Transformations of Automata by Using Behavioural ... |
LATIN
1995
Springer
13 years 11 months ago
1995
Springer
Partitioning automata (PA) are de ned. They are equivalent to cellular automata (CA). Reversible sub-classes are also equivalent. A simple, reversible and universal partitioning au...
CORR
2009
Springer
13 years 5 months ago
2009
Springer
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...
BIRTHDAY
2004
Springer
14 years 29 days ago
2004
Springer
We give faster algorithms for two methods of reducing the number of states in nondeterministic finite automata. The first uses equivalences and the second uses preorders. We deve...
IJFCS
2007
13 years 7 months ago
2007
Weighted finite automata (WFA) are used with FPGA accelerating hardware to scan large genomic banks. Hardwiring such automata raises surface area and clock frequency constraints,...
IJFCS
2008
13 years 7 months ago
2008
We consider the equivalence problem for labeled Markov chains (LMCs), where each state is labeled with an observation. Two LMCs are equivalent if every finite sequence of observat...