The following pages link to (Q4807824):
Displayed 23 items.
- Shuffled languages -- representation and recognition (Q388107) (← links)
- Tree shuffle (Q389936) (← links)
- State complexity of star of union and square of union on \textit{k} regular languages (Q391180) (← links)
- State complexity of combined operations for suffix-free regular languages (Q392179) (← links)
- State complexity of union and intersection of star on \(k\) regular languages (Q418766) (← links)
- State complexity of combined operations with two basic operations (Q441851) (← links)
- Algorithmic decomposition of shuffle on words (Q714805) (← links)
- State complexity of union and intersection of square and reversal on \(k\) regular languages (Q714820) (← links)
- On the Hopcroft's minimization technique for DFA and DFCA (Q1019723) (← links)
- State complexity of unique rational operations (Q1019724) (← links)
- State complexity of basic operations on suffix-free regular languages (Q1029324) (← links)
- State complexity of some operations on binary regular languages (Q1763716) (← links)
- Nondeterministic complexity in subclasses of convex languages (Q2319915) (← links)
- State complexity of permutation on finite languages over a binary alphabet (Q2358683) (← links)
- State complexity of combined operations (Q2383591) (← links)
- Operations on Unambiguous Finite Automata (Q2817392) (← links)
- On the State Complexity of the Shuffle of Regular Languages (Q2829972) (← links)
- State complexity of cyclic shift (Q3515466) (← links)
- Hopcroft’s Minimization Technique: Queues or Stacks? (Q3602803) (← links)
- State Complexity of Combined Operations for Prefix-Free Regular Languages (Q3618598) (← links)
- Operations on Unambiguous Finite Automata (Q4683235) (← links)
- State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal (Q5200089) (← links)
- State complexity of deletion and bipolar deletion (Q5963404) (← links)