A tree is regular if it is isomorphic to the prefix order on a regular language. In case regular languages are represented by NFAs (DFAs), the isomorphism ...
Feb 14, 2011 · Abstract:The computational 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 regular language. In case regular languages are represented by NFAs (DFAs), the isomorphism ...
A tree is regular if it is isomorphic to the prefix order on a regular language. In case regular languages are repre- sented by NFAs (DFAs), the isomorphism ...
Semantic Scholar extracted view of "Isomorphism of regular trees and words" by Markus Lohrey et al.
Dec 21, 2012 · A tree is regular if it is isomorphic to the prefix order on a regular language. In case regular languages are represented by NFAs (DFAs), the ...
Nov 7, 2011 · A generalized word w is regular ⇐⇒ w = val(e) for a regular expression e. Lohrey, Mathissen (University of Leipzig). Isomorphism of regular ...
People also ask
What is tree isomorphism?
How do you know if a tree is isomorphic?
What is the problem of isomorphic subtree?
A tree is regular if it is isomorphic to the prefix order on a regular language. In case regular languages are represented by NFAs (DFAs), the isomorphism ...
Tags: #morphism · #word · Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Bibliographic details on Isomorphism of regular trees and words.