Tree generating context-free grammars and regular tree grammars are equivalent

DOI10.33039/AMI.2022.12.007OpenAlexW4313439931MaRDI QIDQ5886207

Dávid Kószó

Publication date: 30 March 2023

Published in: Annales Mathematicae et Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.33039/ami.2022.12.007

zbMATH Keywords

decidabilitycontext-free grammartree languageregular tree grammarparenthesis grammartree generating context-free grammar

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

The equivalence of tree adjoining grammars and monadic linear context-free tree grammars

This page was built for publication: Tree generating context-free grammars and regular tree grammars are equivalent

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