Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
From MaRDI portal
Publication:3625777
DOI10.3233/FI-2009-0008zbMath1161.68534OpenAlexW2109787457MaRDI QIDQ3625777
Kai Salomaa, Yo-Sub Han, Derick Wood
Publication date: 22 May 2009
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2009-0008
Related Items (19)
State complexity of permutation on finite languages over a binary alphabet ⋮ Networks of evolutionary processors: the power of subregular filters ⋮ Nondeterministic complexity of operations on free and convex languages ⋮ Nondeterministic operational complexity in subregular languages ⋮ Prefix-free languages: left and right quotient and reversal ⋮ A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity ⋮ Nondeterministic state complexity of star-free languages ⋮ On external contextual grammars with subregular selection languages ⋮ Power, positive closure, and quotients on convex languages ⋮ Nondeterministic State Complexity of Star-Free Languages ⋮ Non-regular Maximal Prefix-Free Subsets of Regular Languages ⋮ Nondeterministic Complexity of Operations on Closed and Ideal Languages ⋮ Kuratowski Algebras Generated by Prefix-Free Languages ⋮ Nondeterministic complexity in subclasses of convex languages ⋮ Descriptional complexity of regular languages ⋮ Prefix-Free Subsets of Regular Languages and Descriptional Complexity ⋮ Star-Complement-Star on Prefix-Free Languages ⋮ State complexity of unambiguous operations on finite automata ⋮ Operations on subregular languages and nondeterministic state complexity
This page was built for publication: Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
