Page 1 of 1
Q1. (10 marks) A finite automaton (FA) accepts all and only the strings of 0's and l’s that have the sequence 01 1 somew
Posted: Mon May 02, 2022 12:17 pm
by answerhappygod
- Q1 10 Marks A Finite Automaton Fa Accepts All And Only The Strings Of 0 S And L S That Have The Sequence 01 1 Somew 1 (12.31 KiB) Viewed 32 times
Q1. (10 marks) A finite automaton (FA) accepts all and only the strings of 0's and l’s that have the sequence 01 1 somewhere in the string. Its language is described by {x01y|x and y are any strings of o'sand 1's} Examples of strings for the FA are 01. 11010, and 100011. Examples of strings not in the language include 0, 111000. Design the given FA by showing its state transition diagram.