Show that the following language L is regular by describing it suing a regular expression. L =

Related Book For  answer-question

Digital Signal Processing

ISBN: ?978-0133737622

3rd Edition

Authors: Jonh G. Proakis, Dimitris G.Manolakis

Posted Date: