A Survey on Decidable Equivalence Problems for Tree Transducers

International Journal of Foundations of Computer Science - Singapore
doi 10.1142/s0129054115400134
Full Text
Abstract

Available in full text

Date
Authors
Publisher

World Scientific Pub Co Pte Lt

Related search

Decidability of Equivalence for a Class of Non-Deterministic Tree Transducers

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
1994English

Decision Problems of Tree Transducers With Origin

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2018English

Decidable Problems for Probabilistic Automata on Infinite Words

2012English

Decidable Boundedness Problems for Hyperedge-Replacement Graph Grammars

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1989English

Towards Practical Typechecking for Macro Tree Transducers

English

Decidable Relationships Between Consistency Notions for Constraint Satisfaction Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Probabilistic Automata on Finite Words: Decidable and Undecidable Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

The Suffix Tree of a Tree and Minimizing Sequential Transducers

BRICS Report Series
1995English

Tree-Transducers and Syntax-Connected Transductions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1975English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy