Complexity in Convex Languages

DOI10.1007/978-3-642-13089-2_1zbMath1284.68341OpenAlexW1503154721MaRDI QIDQ3564845

Janusz A. Brzozowski

Publication date: 26 May 2010

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13089-2_1

zbMATH Keywords

complexityfreelanguageidealboundconvexdecision problemregularstate complexityquotientautomatonclosed

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

Nondeterministic complexity of operations on free and convex languages ⋮ Complexity of suffix-free regular languages ⋮ Quotient complexity of closed languages ⋮ Incomplete operational transition complexity of regular languages ⋮ Power, positive closure, and quotients on convex languages ⋮ Nondeterministic complexity in subclasses of convex languages

This page was built for publication: Complexity in Convex Languages