Forest Expressions

DOI10.1007/978-3-540-74915-8_14zbMATH Open1179.68068OpenAlexW2913236170MaRDI QIDQ3608410FDOQ3608410

Authors: Mikołaj Bojańczyk 

Publication date: 5 March 2009

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74915-8_14

Recommendations

• Piecewise testable tree languages
• Publication:5748892
• STACS 2005
• A Kleene Theorem for Forest Languages
• Publication:5748893

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Classical first-order logic (03B10)

Cited In (9)

• Adjunct elimination in context logic for trees
• Simplifying XML schema: single-type approximations of regular tree languages
• Subsequence versus substring constraints in sequence pattern languages
• STACS 2005
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Kleene Theorem for Forest Languages

This page was built for publication: Forest Expressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608410)