3229 search results - page 230 / 646 » The Theory of Timed Automata |
173
click to vote
LICS
2006
IEEE
16 years 19 days ago
2006
IEEE
— In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semi...
162
click to vote
CONIELECOMP
2005
IEEE
16 years 7 days ago
2005
IEEE
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
182
click to vote
ACRI
2004
Springer
16 years 1 days ago
2004
Springer
Modeling free-form shapes in 3D spaces based on strict physical laws require a considerable amount of computation time. Previous experiences with Cellular Automata demonstrated sub...
143
click to vote
WIA
2004
Springer
15 years 12 months ago
2004
Springer
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
206
click to vote
FM
2003
Springer
15 years 12 months ago
2003
Springer
We present a novel application on model checking through SPIN as a means for verifying purely descriptive specifications written in TRIO, a first order, linear-time temporal logic ...