If you form a language L 1 by reversing all the string s of a regular language
Fantastic news! We've Found the answer you've been seeking!
Question:
If you form a language L by reversing all the string s of a regular language L the L is a regular language.
Group of answer choices
True
False
Related Book For
Income Tax Fundamentals 2013
ISBN: 9781285586618
31st Edition
Authors: Gerald E. Whittenburg, Martha Altus Buller, Steven L Gill
Posted Date: