The Gateway to Computer Science Excellence
0 votes
15 views
If $w=a_{1}a_{2}.....a_{n}$ and $x=b_{1}b_{2}....b_{n}$ are strings of the same length, define $alt(w,x)$ to be the string in which the symbols of $w$ and $x$ alternate starting with $w$ that is $a_{1}b_{1}a_{2}b_{2}........a_{n}b_{n}.$If $L$ and $M$ are languages,define $alt(L,M)$ to be the set of strings of the form $alt(w,x),$where $w$ is any string in $L$ and $x$ is any string in $M$ of the same length. Prove that if $L$ and $M$ are regular,so is $alt(L,M).$
in Theory of Computation by Veteran (59.5k points) | 15 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,397 answers
198,610 comments
105,454 users