Forest Expressions

DOI10.1007/978-3-540-74915-8_14MaRDI QIDQ3608410zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(10)

• Subsequence versus substring constraints in sequence pattern languages
• A Kleene Theorem for Forest Languages
• Simplifying XML schema: single-type approximations of regular tree languages
• scientific article; zbMATH DE number 522865 (Why is no real title available?)
• scientific article; zbMATH DE number 1025899 (Why is no real title available?)
• Fair expressions and regular languages over lists
• STACS 2005
• scientific article; zbMATH DE number 4182835 (Why is no real title available?)
• scientific article; zbMATH DE number 4182836 (Why is no real title available?)
• Adjunct elimination in context logic for trees

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)