scientific article; zbMATH DE number 7315104

zbMath1455.68091arXiv1008.1661MaRDI QIDQ4964025

Yo-Sub Han, Kai Salomaa

Publication date: 24 February 2021

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

suffix codessuffix-free regular languagesnondeterministic state complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

Nondeterministic operational complexity in subregular languages ⋮ A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity ⋮ Nondeterministic state complexity of star-free languages ⋮ Power, positive closure, and quotients on convex languages ⋮ Nondeterministic complexity in subclasses of convex languages ⋮ State complexity of unambiguous operations on finite automata ⋮ Operations on subregular languages and nondeterministic state complexity

This page was built for publication: