Dark Mode

Recent questions tagged perfect-shuffle

0 votes

0 answers

1

Michael Sipser Edition 3 Exercise 2 Question 38 (Page No. 158)
For the definition of the perfect shuffle operation. For languages $A$ and $B,$ let the $\text{perfect shuffle}$ of $A$ and $B$ be the language $\text{{$w| w = a_{1}b_{1} · · · a_{k}b_{k},$ ... k} ∈ B,$ each $a_{i}, b_{i} ∈ Σ$}}.$ Show that the class of context-free languages is not closed under perfect shuffle.

admin asked in Theory of Computation Oct 10, 2019

by admin

240 views

0 votes

0 answers

2

Michael Sipser Edition 3 Exercise 1 Question 41 (Page No. 89)
For languages $A$ and $B,$ let the $\text{perfect shuffle}$ of $A$ and $B$ be the language $\text{{$w| w = a_{1}b_{1} · · · a_{k}b_{k},$ where $a_{1} · · · a_{k} ∈ A$ and $b_{1} · · · b_{k} ∈ B,$ each $a_{i}, b_{i} ∈ Σ$}}.$ Show that the class of regular languages is closed under perfect shuffle.

admin asked in Theory of Computation Apr 28, 2019

by admin

455 views

To see more, click for the full list of questions or popular tags.

Recent questions tagged perfect-shuffle