85 search results - page 5 / 17 » Partial Higher-dimensional Automata |
124
click to vote
LICS
2012
IEEE
13 years 3 days ago
2012
IEEE
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
MCU
2007
14 years 11 months ago
2007
We review some results about the computational power of several computational models. Considered models have in common to be related to continuous dynamical systems. 1 Dynamical Sy...
IANDC
2007
14 years 9 months ago
2007
We explore the notion of alternating two-way tree automata modulo the theory of finitely many associative-commutative (AC) symbols. This was prompted by questions arising in cryp...
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
a is an abstract framework for the uniform study of different kinds of dynamical systems. An endofunctor F determines both the type of systems (F-coalgebras) and a notion of behav...
TIME
2002
IEEE
15 years 2 months ago
2002
IEEE
Events employed in natural language semantics are characterized in terms of regular languages, each string in which can be regarded as a motion picture. The relevant finite autom...