Closure of Hedge-Automata Languages by Hedge Rewriting

DOI10.1007/978-3-540-70590-1_11MaRDI QIDQ3522016zbMATH OpenOpenAlexFDO

Authors Florent Jacquemard, Michaël Rusinowitch

Publication date 28 August 2008

Published in Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70590-1_11

Mathematics Subject Classification ID

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

Recommendations

• Rewrite Closure and CF Hedge Automata
• One-variable context-free hedge automata
• Transition Graphs of Rewriting Systems over Unranked Trees
• scientific article; zbMATH DE number 794243
• Closure of tree automata languages under innermost rewriting

Cited in

(5)

• One-variable context-free hedge automata
• Equational approximations for tree automata completion
• Regular expression order-sorted unification and matching
• Rewrite Closure and CF Hedge Automata
• Closure of finite-state automaton languages

This page was built for publication: Closure of Hedge-Automata Languages by Hedge Rewriting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522016)