Question
L 1 = {x {a,b}* | aa is not a substring of x}; L 2 = {x {a, b}* | x ends with ab}. For
L1 = {x 
{a,b}* | aa is not a substring of x}; L2 = {x 
{a, b}* | x ends with ab}. For the FA that accepts L1
L2 , prove that there cannot be any other FA with fewer states accepting the same language.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Advances In Databases And Information Systems Uropean Conference Adbis 2020 Lyon France August 25 27 2020 Proceedings Lncs 12245
Authors: Jerome Darmont ,Boris Novikov ,Robert Wrembel
1st Edition
3030548317, 978-3030548315
