415 search results - page 15 / 83 » Regular Processes and Timed Automata |
TACS
2001
Springer
15 years 6 months ago
2001
Springer
Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize...
127
click to vote
CCR
2010
14 years 11 months ago
2010
This paper presents iNFAnt, a parallel engine for regular expression pattern matching. In contrast with traditional approaches, iNFAnt adopts non-deterministic automata, allowing ...
221
click to vote
ACRI
2010
Springer
15 years 3 months ago
2010
Springer
A method of constructing asynchronous cellular automata (ACA model) as a parallel composition of two interacting ACA is presented. The resulting ACA is intended to simulate a proce...
143
click to vote
RTSS
2005
IEEE
15 years 7 months ago
2005
IEEE
Recently there has been a growing interest in models and methods targeted towards the (co)design of stream processing applications; e.g. those for audio/video processing. Streams ...
123
Voted
JALC
2007
15 years 1 months ago
2007
The basic finite automata model has been extended over the years with different acceptance modes (nondeterminism, alternation), new or improved devices (two-way heads, pebbles, ...