46 search results - page 1 / 10 » Isomorphism of regular trees and words |
CORR
2011
Springer
13 years 5 months ago
2011
Springer
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...
DLT
2008
14 years 10 days ago
2008
Abstract. Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative ...
AI
2010
Springer
13 years 11 months ago
2010
Springer
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
ICDT
2012
ACM
12 years 1 months ago
2012
ACM
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
IPCO
2001
14 years 8 days ago
2001
The paper presents a branch-and-cut for solving (0, 1) integer linear programs having a large symmetry group. The group is used for pruning the enumeration tree and for generating ...