CCS expressions finite state processes, and three problems of equivalence
Information and Computation
A logspace algorithm for tree canonization (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
On Infinite Terms Having a Decidable Monadic Theory
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
The Definability of Equational Graphs in Monadic Second-Order Logic
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Testing Equivalence of Morphisms on Context-Free Languages
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Completeness results for graph isomorphism
Journal of Computer and System Sciences
The equational theory of regular words
Information and Computation
The Isomorphism Problem on Classes of Automatic Structures
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
An undecidable property of context-free linear orders
Information Processing Letters
Processing compressed texts: a tractability border
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Hausdorff rank of scattered context-free linear orders
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
On context-free languages of scattered words
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
A context-free linear ordering with an undecidable first-order theory
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Isomorphism of regular trees and words
Information and Computation
Hi-index | 0.00 |
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 regular language. In case regular languages are represented by NFAs (DFAs), the isomorphism problem for regular trees turns out to be EXPTIME-complete (resp. P-complete). In case the input automata are acyclic NFAs (acyclic DFAs), the corresponding trees are (succinctly represented) finite trees, and the isomorphism problem turns out to be PSPACE-complete (resp. P-complete). A linear order is regular if it is isomorphic to the lexicographic order on a regular language. A polynomial time algorithm for the isomorphism problem for regular linear orders (and even regular words, which generalize the latter) given by DFAs is presented. This solves an open problem by Ésik and Bloom. A long version of this paper can be found in [18].