Nested Sibling Tree Automata

DOI10.1051/ita/2009006zbMath1171.68020OpenAlexW2115109411MaRDI QIDQ3625699

F. Gire, Jean-Marc Talbot

Publication date: 6 May 2009

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2009__43_2_379_0/

zbMATH Keywords

automatalogicXML schemasunranked trees

Mathematics Subject Classification ID

Database theory (68P15) Formal languages and automata (68Q45) Data structures (68P05)

Cites Work

• Unnamed Item
• Tree automata with one memory set constraints and cryptographic protocols
• Visibly pushdown languages
• A fixpoint calculus for local and global program flows
• Automata, Languages and Programming
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Languages of Nested Trees
• Tree Automata with Memory, Visibility and Structural Constraints

This page was built for publication: Nested Sibling Tree Automata