Complexity of proper suffix-convex regular languages

DOI10.1007/978-3-319-94812-6_27OpenAlexW2953001510MaRDI QIDQ1616989

Corwin Sinnamon

Publication date: 7 November 2018

Full work available at URL: https://arxiv.org/abs/1805.03375

zbMATH Keywords

atomregular languagestate complexitypropersyntactic semigroupmost complexquotient complexitysuffix-convex

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Power, positive closure, and quotients on convex languages ⋮ Complexity of bifix-free regular languages

This page was built for publication: Complexity of proper suffix-convex regular languages