233 search results - page 17 / 47 » Equivalent Transformations of Automata by Using Behavioural ... |
IANDC
2006
13 years 7 months ago
2006
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
We propose that the behaviour of non-linear media can be controlled automatically through coevolutionary systems. By extension, forms of unconventional computing, i.e., massively ...
WIA
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. In 6], G. Myers describes a bit-vector algorithm to compute the edit distance between strings. The algorithm converts an input sequence to an output sequence in a paralle...
ADBIS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We propose a descriptive high-level language XDTrans devoted to specify transformations over XML data. The language is based on unranked tree automata approach. In contra...
TACS
2001
Springer
14 years 1 days 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...