Descriptional complexity of power and positive closure on convex languages

DOI10.1007/978-3-030-23679-3_13zbMath1434.68261OpenAlexW2953657152MaRDI QIDQ2177606

Michal Hospodár

Publication date: 6 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-23679-3_13

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Power, positive closure, and quotients on convex languages

This page was built for publication: Descriptional complexity of power and positive closure on convex languages