Pumping, cleaning and symbolic constraints solving

DOI10.1007/3-540-58201-0_88zbMath1418.68114OpenAlexW1564330433MaRDI QIDQ4632446

Anne-Cecile Caron, Florent Jacquemard, Jean-Luc Coquidé, Max Dauchet, Hubert Comon

Publication date: 29 April 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58201-0_88

zbMATH Keywords

tree automatonground termfunction symbolclose equalitytemporary leaf

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (11)

Ground reducibility is EXPTIME-complete ⋮ Abstract data type systems ⋮ Tree automata with equality constraints modulo equational theories ⋮ E-generalization using grammars ⋮ Specification and proof in membership equational logic ⋮ Decidability of equivalence for deterministic synchronized tree automata ⋮ Unification in pseudo-linear sort theories is decidable ⋮ Multitree automata that count ⋮ Grid structures and undecidable constraint theories ⋮ Decidability of equivalence for deterministic synchronized tree automata ⋮ Recognizable tree-languages and nonlinear morphisms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Testing for the ground (co-)reducibility property in term-rewriting systems
• On sufficient-completeness and related properties of term rewriting systems
• Narrowing based procedures for equational disunification
• Automatic proofs by induction in theories without constructors
• Semantic confluence tests and completion methods
• Encompassment properties and automata with constraints
• Equality and disequality constraints on direct subterms in tree automata

This page was built for publication: Pumping, cleaning and symbolic constraints solving