Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees
DOI10.1007/978-3-540-70844-5_29zbMATH Open1172.68485OpenAlexW1548427228MaRDI QIDQ3602823FDOQ3602823
Authors: 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
Recommendations
Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
Cited In (5)
This page was built for publication: Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602823)