2 search results - page 1 / 1 » Copyless Cost-Register Automata: Structure, Expressiveness, ... |
CSR
2007
Springer
13 years 11 months ago
2007
Springer
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
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...