Closure of Hedge-Automata Languages by Hedge Rewriting

DOI10.1007/978-3-540-70590-1_11zbMATH Open1146.68039OpenAlexW1564377554MaRDI QIDQ3522016FDOQ3522016

Michaël Rusinowitch, Florent Jacquemard

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)

Cited In (5)

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

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)