Isomorphism of regular trees and words
DOI10.1016/j.ic.2013.01.002zbMath1295.68124MaRDI QIDQ1951601
Markus Lohrey, Christian Mathissen
Publication date: 6 June 2013
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2013.01.002
computational complexity; regular trees; finite automata; regular languages; automatic structures; regular words; isomorphism problems; generalized words
68Q25: Analysis of algorithms and problem complexity
68R15: Combinatorics on words
68Q45: Formal languages and automata
03D05: Automata and formal grammars in connection with logical questions
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
03C57: Computable structure theory, computable model theory
Related Items