Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees

DOI10.1007/978-3-540-70844-5_29zbMath1172.68485OpenAlexW1548427228MaRDI QIDQ3602823

Akio Fujiyoshi

Publication date: 12 February 2009

Published in: Implementation and Applications of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70844-5_29

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42)

Related Items (1)

Weak Inclusion for XML Types

Cites Work

• Implementation and Application of Automata

This page was built for publication: Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees