396 search results - page 29 / 80 » Factor Automata of Automata and Applications |
104
click to vote
IJFCS
2006
14 years 11 months ago
2006
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
LATA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. In this paper we prove the following result. Let s be an infinite word on a finite alphabet, and N ≥ 0 be an integer. Suppose that all left special factors of s longe...
SSD
2001
Springer
15 years 4 months ago
2001
Springer
The notion of time granularity comes into play in a variety of problems involving time representation and management in database applications, including temporal database design, t...
ADAEUROPE
2008
Springer
15 years 1 months ago
2008
Springer
The Ravenscar profile for Ada enforces several restrictions on the usage of general-purpose tasking constructs, thereby facilitating most analysis tasks and in particular functiona...
FLAIRS
2001
15 years 1 months ago
2001
In formallyanalyzinganddevelopingindustrialsizedsystems weare often confrontedwiththe problemof expressingrealtimeproperties.Especiallyin safetycritical applications as, for examp...