55 search results - page 4 / 11 » Pomset Languages of Finite Step Transition Systems |
FOSSACS
2000
Springer
13 years 11 months ago
2000
Springer
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold...
ICALP
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. We consider systems of finite automata performing together computation on an input string. Each automaton has its own read head that moves independently of the other head...
ACCV
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We propose a new principle for recognizing fingerspelling sequences from American Sign Language (ASL). Instead of training a system to recognize the static posture for ea...
ACSD
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--Semantics of many specification languages, particularly those used in the domain of hardware, is described in terms of vector-based transition systems. In such a transiti...
CGF
2006
13 years 7 months ago
2006
We propose a new technique for quad-dominant remeshing which separates the local regularity requirements from the global alignment requirements by working in two steps. In the fir...