Complexity of decision problems on totally rigid acyclic tree grammars

DOI10.1007/978-3-319-98654-8_24OpenAlexW2886621102MaRDI QIDQ1622974

Gabriel Ebner, Stefan Hetzl, Sebastian Eberhard

Publication date: 22 November 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-98654-8_24

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

On the cover complexity of finite languages

This page was built for publication: Complexity of decision problems on totally rigid acyclic tree grammars