3169 search results - page 35 / 634 » Robust Timed Automata |
181
click to vote
MFCS
2007
Springer
16 years 1 days ago
2007
Springer
In this paper we study language recognition by two-dimensional cellular automata on different possible neighborhoods. Since it is known that all complete neighborhoods are linearl...
155
click to vote
FMOODS
2006
15 years 7 months ago
2006
Long-Running transactions consist of tasks which may be executed sequentially and in parallel, may contain sub-tasks, and may require to be completed before a deadline. These trans...
159
click to vote
HYBRID
2009
Springer
16 years 21 days 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...
167
click to vote
STACS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. It is well known that one-dimensional cellular automata working on the usual neighborhood are Turing complete, and many acceleration theorems are known. However very litt...
147
click to vote
FOSSACS
2004
Springer
15 years 11 months ago
2004
Springer
In this work we generalize the fundamental notion of recognizability from untimed to timed languages. The essence of our definition is the existence of a right-morphism from the m...