25 search results - page 1 / 5 » On the Expressiveness of Deterministic Transducers over Infi... |
STACS
2004
Springer
13 years 11 months ago
2004
Springer
FSTTCS
2010
Springer
13 years 3 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...
DLT
2010
13 years 5 months ago
2010
We show that for every deterministic bottom-up tree transducer, a unique equivalent transducer can be constructed which is minimal. The construction is based on a sequence of norma...
IANDC
1998
13 years 5 months ago
1998
ed tree transducers are abstract models used to study properties bute grammars. One abstraction which occurs when modeling attribute grammars by attributed tree transducers is that...
LATA
2010
Springer
13 years 9 months ago
2010
Springer
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...