346 search results - page 25 / 70 » Determinizing Asynchronous Automata |
ACTAC
2006
14 years 10 months ago
2006
The algebraic hierarchical decomposition of finite state automata can be applied wherever a finite system should be `understood' using a hierarchical coordinate system. Here ...
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...
MEMOCODE
2003
IEEE
15 years 3 months ago
2003
IEEE
In this paper, we present a technique for determining tight bounds on the execution time of assembler programs. Thus, our method is independent of the design flow, but takes into...
101
click to vote
BIRTHDAY
2008
Springer
15 years 21 hour ago
2008
Springer
Abstract. Church's Problem, stated fifty years ago, asks for a finitestate machine that realizes the transformation of an infinite sequence into an infinite sequence such tha...
ISCI
2010
14 years 8 months ago
2010
: We investigate weighted finite automata over strings and strong bimonoids. Such algebraic structures satisfy the same laws as semirings except that no distributivity laws need t...