English

Rewriting Preserving Recognizability of Finite Tree Languages

Logic in Computer Science 2010-06-30 v1 Formal Languages and Automata Theory
Authors: Sandor vagvolgyi
View on arXiv ↗ PDF ↗

Abstract

We show that left-linear generalized semi-monadic TRSs effectively preserving recognizability of finite tree languages (are EPRF-TRSs). We show that reachability, joinability, and local confluence are decidable for EPRF-TRSs.

Keywords

tree language recognizability term rewriting system left-linear generalized semi-monadic reachability joinability local confluence

Cite

@article{arxiv.1006.5516,
  title  = {Rewriting Preserving Recognizability of Finite Tree Languages},
  author = {Sandor vagvolgyi},
  journal= {arXiv preprint arXiv:1006.5516},
  year   = {2010}
}

Related papers

View all related →
Formal Languages and Automata Theory · Computer Science
Semilinearity of Families of Languages
Oscar H. Ibarra, Ian McQuillan
2022-12-05
Dynamical Systems · Mathematics
Decidability of irreducible tree shifts of finite type
Jung-Chao Ban, Chih-Hung Chang, Nai-Zhu Huang, Yu-Liang Wu
2020-01-08
Formal Languages and Automata Theory · Computer Science
Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time
Adrien Boiret, Raphaela Palenta
2016-06-14
Formal Languages and Automata Theory · Computer Science
Some Remarks on First-Order Definable Tree Languages
Achim Blumensath
2024-07-02
Computation and Language · Computer Science
Non-simplifying Graph Rewriting Termination
Guillaume Bonfante, Bruno Guillaume
2013-02-27
Computer Vision and Pattern Recognition · Computer Science
Rethinking Learnable Tree Filter for Generic Feature Transform
Lin Song, Yanwei Li, Zhengkai Jiang, Zeming Li +4
2020-12-08
Formal Languages and Automata Theory · Computer Science
Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable
Helmut Seidl, Sebastian Maneth, Gregor Kemper
2017-01-30
Formal Languages and Automata Theory · Computer Science
A decidable characterization of locally testable tree languages
Thomas Place, Luc Segoufin
2015-07-01
Computation and Language · Computer Science
Unsupervised Learning of Explainable Parse Trees for Improved Generalisation
Atul Sahay, Ayush Maheshwari, Ritesh Kumar, Ganesh Ramakrishnan +2
2021-04-13
Logic in Computer Science · Computer Science
Complete Axiomatizations of Fragments of Monadic Second-Order Logic on Finite Trees
Amélie Gheerbrant, Balder ten Cate
2015-07-01
Logic in Computer Science · Computer Science
Termination of Rewriting with Right-Flat Rules Modulo Permutative Theories
Luis Barguno, Guillem Godoy, Eduard Huntingford, Ashish Tiwari
2015-07-01
Logic in Computer Science · Computer Science
Local Termination: theory and practice
Joerg Endrullis, Roel de Vrijer, Johannes Waldmann
2015-07-01
Computational Complexity · Computer Science
Residual Finite Tree Automata
J. Carme, R. Gilleron, A. Lemay, A. Terlutte +1
2007-05-23
Computation and Language · Computer Science
Improved Semantic Representations From Tree-Structured Long Short-Term Memory Networks
Kai Sheng Tai, Richard Socher, Christopher D. Manning
2015-06-02
Computation and Language · Computer Science
Retrofitting Structure-aware Transformer Language Model for End Tasks
Hao Fei, Yafeng Ren, Donghong Ji
2020-09-17
Logic in Computer Science · Computer Science
Recovering Commutation of Logically Constrained Rewriting and Equivalence Transformations (Full Version)
Kanta Takahata, Jonas Schöpf, Naoki Nishida, Takahito Aoto
2025-12-16
Formal Languages and Automata Theory · Computer Science
Characterization of deterministically recognizable weighted tree languages over commutative semifields by finitely generated and cancellative scalar algebras
Zoltán Fülöp, Heiko Vogler
2025-09-19
Computational Complexity · Computer Science
On the Complexity of Verification of Time-Sensitive Distributed Systems: Technical Report
Max Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov +1
2021-09-16
Computation and Language · Computer Science
Exploiting Syntactic Features in a Parsed Tree to Improve End-to-End TTS
Haohan Guo, Frank K. Soong, Lei He, Lei Xie
2019-04-10
Logic in Computer Science · Computer Science
Algebraic recognizability of languages
Pascal Weil
2007-05-23
Logic in Computer Science · Computer Science
Wreath Products of Forest Algebras, with Applications to Tree Logics
Mikolaj Bojanczyk, Igor Walukiewicz, Howard Straubing
2015-07-01
Formal Languages and Automata Theory · Computer Science
Tensor Product Representations of Subregular Formal Languages
Jonathan Rawski
2019-08-23
Logic in Computer Science · Computer Science
Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems
Max Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov +1
2024-07-03
Formal Languages and Automata Theory · Computer Science
Invisible pushdown languages
Eryk Kopczynski
2015-11-03
Logic in Computer Science · Computer Science
Termination of LCTRSs
Cynthia Kop
2016-01-14