Equality and disequality constraints on direct subterms in tree automata
From MaRDI portal
Publication:5096779
DOI10.1007/3-540-55210-3_181zbMATH Open1493.68183OpenAlexW160847359MaRDI QIDQ5096779FDOQ5096779
Authors: Bruno Bogaert, Sophie Tison 
Publication date: 18 August 2022
Published in: STACS 92 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55210-3_181
Recommendations
Cites Work
- Title not available (Why is that?)
- On sufficient-completeness and related properties of term rewriting systems
- Computational aspects of an order-sorted logic with term declarations
- Title not available (Why is that?)
- Equational formulae with membership constraints
- The Church-Rosser property for ground term-rewriting systems is decidable
- Title not available (Why is that?)
Cited In (31)
- Logics for unordered trees with data constraints
- Projection for Büchi Tree Automata with Constraints between Siblings
- Recognizable tree-languages and nonlinear morphisms
- Encompassment properties and automata with constraints
- Emptiness and finiteness for tree automata with global reflexive disequality constraints
- E-generalization using grammars
- Parameter reduction and automata evaluation for grammar-compressed trees
- Multitree automata that count
- Tree Automata with Equality Constraints Modulo Equational Theories
- Alternating two-way AC-tree automata
- On the equivalence problem for letter-to-letter top-down tree transducers
- Tree Automata with Global Constraints
- Unification in pseudo-linear sort theories is decidable
- Grid structures and undecidable constraint theories
- Weighted tree automata with constraints
- Decidability of equivalence for deterministic synchronized tree automata
- Tree Automata for Non-linear Arithmetic
- Unranked Tree Automata with Sibling Equalities and Disequalities
- Weighted tree automata with constraints
- Closure of tree automata languages under innermost rewriting
- Tree automata with equality constraints modulo equational theories
- The emptiness problem for tree automata with at least one global disequality constraint is NP-hard
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
- Rigid tree automata and applications
- Title not available (Why is that?)
- Sequentiality, monadic second-order logic and tree automata.
- Pumping, cleaning and symbolic constraints solving
- Tree automata for rewrite strategies
- Towards an efficient construction of test sets for deciding ground reducibility
- On positive TAGED with a bounded number of constraints
- Decidability of equivalence for deterministic synchronized tree automata
This page was built for publication: Equality and disequality constraints on direct subterms in tree automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096779)
