One-variable context-free hedge automata

DOI10.1016/j.jcss.2016.10.006zbMath1423.68256OpenAlexW2547455473MaRDI QIDQ2424690

Michaël Rusinowitch, Florent Jacquemard

Publication date: 25 June 2019

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01426626/file/CFHA-long.pdf

zbMATH Keywords

verificationaccess controlhedge automatastatic type checkingrewrite closureXQuery update

Mathematics Subject Classification ID

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

Related Items (1)

Special issue: Selected papers of the 9th international conference on language and automata theory and applications, LATA 2015

Uses Software

• Timbuk

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Validating XML document adaptations via hedge automata transformations
• Computational complexity of the problem of tree generation under fine-grained access control policies
• Reachability analysis over term rewriting systems
• Automata for XML -- a survey
• Deterministic tree pushdown automata and monadic tree rewriting systems
• Bottom-up tree pushdown automata: Classification and connection with rewrite systems
• Typechecking for XML transformers
• Query automata over finite trees
• Controlled Term Rewriting
• Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies
• Closure of Hedge-Automata Languages by Hedge Rewriting
• Tree Automata with Global Constraints
• Rewrite Closure and CF Hedge Automata
• Unranked Tree Automata with Sibling Equalities and Disequalities
• Recognition and parsing of context-free languages in time n3
• Term Rewriting and Applications

This page was built for publication: One-variable context-free hedge automata