1279 search results - page 3 / 256 » Fast Implementations of Automata Computations |
ATVA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
ITICSE
2005
ACM
14 years 1 months ago
2005
ACM
FAdo1 is an ongoing project which aims the development of an interactive environment for symbolic manipulation of formal languages. In this paper we focus in the description of in...
COORDINATION
2005
Springer
14 years 1 months ago
2005
Springer
ICIAP
1999
ACM
13 years 11 months ago
1999
ACM
Real-world tasks often require real-time performances. However, in many practical cases, “just in time” responses are sufficient. This means that a system should be efficien...
ICS
2010
Tsinghua U.
14 years 4 months ago
2010
Tsinghua U.
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...