Descendants of a recognizable tree language for sets of linear monadic term rewrite rules

DOI10.1016/j.ipl.2006.03.008zbMath1184.68302OpenAlexW2085600536MaRDI QIDQ845695

Sándor Vágvölgyi

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.03.008

zbMATH Keywords

formal languagestree automatondescendant of a tree languagemonadic term rewrite system

Mathematics Subject Classification ID

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

Related Items

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

Uses Software

• Timbuk

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reachability analysis over term rewriting systems
• 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