SIAMCOMP
2000
13 years 4 months ago
2000
The main result is a finite-state version of the Kraft
PPDP
2001
Springer
13 years 9 months ago
2001
Springer
Cyclic data structures can be tricky to create and manipulate in declarative programming languages. In a declarative setting, a natural way to view cyclic structures is as denotin...
ICALP
2004
Springer
13 years 10 months ago
2004
Springer
We consider the Edit distance with moves on the class of words and the class of ordered trees. We first exhibit a simple tester for the class of regular languages on words and gen...
FSTTCS
2004
Springer
13 years 10 months ago
2004
Springer
In this paper we provide an automaton-based solution to the decision problem for a large set of monadic second-order theories of deterministic tree structures. We achieve it in two...