scientific article
From MaRDI portal
Publication:3655366
zbMath1182.68105MaRDI QIDQ3655366
Yo-Sub Han, Kai Salomaa, Derick Wood
Publication date: 7 January 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (19)
STATE COMPLEXITY OF CODE OPERATORS ⋮ The cut operation in subclasses of convex languages (extended abstract) ⋮ Quotient complexity of closed languages ⋮ Shuffled languages -- representation and recognition ⋮ State complexity of combined operations for suffix-free regular languages ⋮ Kleene closure and state complexity ⋮ Prefix-free languages: left and right quotient and reversal ⋮ The cut operation in subclasses of convex languages ⋮ Operational complexity in subregular classes ⋮ Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages ⋮ Syntactic complexity of regular ideals ⋮ Power, positive closure, and quotients on convex languages ⋮ Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages ⋮ Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation ⋮ Kuratowski Algebras Generated by Prefix-Free 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 ⋮ Closure properties of subregular languages under operations
This page was built for publication:
