119 search results - page 7 / 24 » On finite alphabets and infinite bases |
FSTTCS
2010
Springer
13 years 7 months ago
2010
Springer
Streaming string transducers [1] define (partial) functions from input strings to output strings. A streaming string transducer makes a single pass through the input string and us...
ORDER
2006
13 years 9 months ago
2006
The C-subfunction relations on the set of functions on a finite base set A defined by function classes C are examined. For certain clones C on A, it is determined whether the part...
CDC
2010
IEEE
13 years 4 months ago
2010
IEEE
Abstract-- We present a computational framework for identifying a set of initial states from which all trajectories of a piecewise affine (PWA) system satisfy a Linear Temporal Log...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
FOSSACS
2004
Springer
14 years 1 months ago
2004
Springer
In the literature there are several CCS-like process calculi differing in the constructs for the specification of infinite behavior and in the scoping rules for channel names. In t...