scientific article; zbMATH DE number 1916664
From MaRDI portal
Publication:4807824
zbMath1033.68057MaRDI QIDQ4807824
Kai Salomaa, Sheng Yu, Cezar Campeanu
Publication date: 28 March 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (30)
State complexity of permutation on finite languages over a binary alphabet ⋮ State complexity of combined operations ⋮ Shuffled languages -- representation and recognition ⋮ Tree shuffle ⋮ State complexity of star of union and square of union on \textit{k} regular languages ⋮ State complexity of combined operations for suffix-free regular languages ⋮ Nondeterministic operational complexity in subregular languages ⋮ State complexity of union and intersection of star on \(k\) regular languages ⋮ Unnamed Item ⋮ Operational complexity: NFA-to-DFA trade-off ⋮ State complexity of cyclic shift ⋮ State complexity of combined operations with two basic operations ⋮ Operations on Unambiguous Finite Automata ⋮ State complexity of some operations on binary regular languages ⋮ Algorithmic decomposition of shuffle on words ⋮ State complexity of union and intersection of square and reversal on \(k\) regular languages ⋮ Hopcroft’s Minimization Technique: Queues or Stacks? ⋮ State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal ⋮ State complexity of deletion and bipolar deletion ⋮ State Complexity of Combined Operations for Prefix-Free Regular Languages ⋮ Operations on Unambiguous Finite Automata ⋮ On the Hopcroft's minimization technique for DFA and DFCA ⋮ State complexity of unique rational operations ⋮ On the State Complexity of the Shuffle of Regular Languages ⋮ State complexity of basic operations on suffix-free regular languages ⋮ Nondeterministic complexity in subclasses of convex languages ⋮ Descriptional complexity of regular languages ⋮ Commutative regular languages with product-form minimal automata ⋮ State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages ⋮ The commutative closure of shuffle languages over group languages is regular
This page was built for publication:
