Publication:4964025
From MaRDI portal
zbMath1455.68091arXiv1008.1661MaRDI QIDQ4964025
Publication date: 24 February 2021
Full work available at URL: https://arxiv.org/abs/1008.1661
68Q45: Formal languages and automata
Related Items
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, Operations on subregular languages and nondeterministic state complexity, Nondeterministic complexity in subclasses of convex languages, State complexity of unambiguous operations on finite automata