Sciweavers

46 search results - page 2 / 10
» Isomorphism of regular trees and words
Sort
View
ICALP
2004
Springer
13 years 10 months ago
Property Testing of Regular Tree Languages
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...
Frédéric Magniez, Michel de Rougemon...
ACTAC
2008
97views more  ACTAC 2008»
13 years 4 months ago
$M$-Solid Varieties of Languages
In this paper, a characterization of the language varieties and congruence varieties corresponding to M-solid pseudovarieties is presented. Taking into account the isomorphisms of...
Pedro Baltazar
ACTA
2000
302views more  ACTA 2000»
13 years 4 months ago
Efficiently building a parse tree from a regular expression
We show in this paper that parsing with regular expressions instead of context-free grammars, when it is possible, is desirable. We present efficient algorithms for performing diff...
Danny Dubé, Marc Feeley
MST
2006
129views more  MST 2006»
13 years 4 months ago
Reachability Problems on Regular Ground Tree Rewriting Graphs
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
Christof Löding
CAV
2004
Springer
152views Hardware» more  CAV 2004»
13 years 10 months ago
Abstract Regular Model Checking
Regular Tree Model Checking Ahmed Bouajjani, Peter Habermehl 1 LIAFA, University Paris 7, Case 7014, 2, place Jussieu, F-75251 Paris Cedex 05, France Adam Rogalewicz, Tom´aˇs Voj...
Ahmed Bouajjani, Peter Habermehl, Tomás Voj...