Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy

DOI10.1016/J.TCS.2018.04.026zbMath1398.68329OpenAlexW2800997701MaRDI QIDQ1637228

Sándor Vágvölgyi

Publication date: 7 June 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.04.026

zbMATH Keywords

tree automatonrecognizable tree languagedescendant of a tree languagemonadic term-rewriting systemposition-cutting rewritingprefix-constrained rewriting

Mathematics Subject Classification ID

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

Uses Software

• Timbuk

Cites Work

• Reachability analysis over term rewriting systems
• Termination criteria for tree automata completion
• Descendants of a recognizable tree language for sets of linear monadic term rewrite rules
• Deterministic tree pushdown automata and monadic tree rewriting systems
• Linear generalized semi-monadic rewrite systems effectively preserve recognizability
• Some undecidability results concerning the property of preserving regularity
• Bottom-up tree pushdown automata: Classification and connection with rewrite systems
• Tree automata for rewrite strategies
• Reachability Analysis of Term Rewriting Systems with Timbuk
• Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy