Closure of Tree Automata Languages under Innermost Rewriting

DOI10.1016/j.entcs.2009.03.033zbMath1294.68103OpenAlexW2012732732MaRDI QIDQ5170159

Adrià Gascón, Guillem Godoy, Florent Jacquemard

Publication date: 22 July 2014

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.03.033

zbMATH Keywords

tree automataterm rewritingrewrite strategies

Mathematics Subject Classification ID

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

Related Items (2)

Unnamed Item ⋮ Termination criteria for tree automata completion

Cites Work

• Deterministic tree pushdown automata and monadic tree rewriting systems
• Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems
• Decidable approximations of term rewriting systems
• Equality and disequality constraints on direct subterms in tree automata
• The Confluence Problem for Flat TRSs
• Computer Science Logic
• Bottom-Up Rewriting Is Inverse Recognizability Preserving
• Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems
• Termination of Rewriting with Right-Flat Rules
• Tree generating regular systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Closure of Tree Automata Languages under Innermost Rewriting