Encompassment properties and automata with constraints
From MaRDI portal
Publication:5055805
DOI10.1007/978-3-662-21551-7_25zbMath1503.03039MaRDI QIDQ5055805
Anne-Cecile Caron, Max Dauchet, Jean-Luc Coquidé
Publication date: 9 December 2022
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-21551-7_25
03D05: Automata and formal grammars in connection with logical questions
03B25: Decidability of theories and sets of sentences
Related Items
Decidability of equivalence for deterministic synchronized tree automata, The first-order theory of linear one-step rewriting is undecidable, On the equivalence problem for letter-to-letter top-down tree transducers, Recognizable tree-languages and nonlinear morphisms, On rewrite constraints and context unification, Observational proofs by rewriting., Sequentiality, monadic second-order logic and tree automata., Automata-driven automated induction, The undecidability of the first-order theories of one step rewriting in linear canonical systems, Thue trees, Ground reducibility is EXPTIME-complete, Specification and proof in membership equational logic, Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems