# Recent questions in Theory of Automata

No documents found, press Enter to search

# b) Can you say that for a certain string there may be more than one paths in a TG?

Can you say that for a certain string there may be more than one paths in a TG?
0

# I Face Difficulty In this Assignment Kindly Help Me...Subject: Theory Of Automata

Let ∑ = {a, b} Construct DFA’s for Following also write their Regular expressions.• All words with b as a third letter.• Only the words baaba, abab and ababa and no other string.• Only those words that begin with triple a or end with double b letter.• Only those words that have even number of substrings ba• All words with even lengths and in which each a is separated by some b’s and boccupies all even positions.• All words beginning and ending with same letter.​​Let ∑ = {0, 1} Construct NFA’s for Following also write their Recursive Definitions.• Machine that accepts the language which has either odd number of 1’s or even number of 0’s but not both together.• Machine that accepts the language which has both 010 and 110 as substring.• Machine that accepts the language which has neither 11 nor 00 as a substring.• Machine that accepts all strings with at most three 0’s.• Machine that accepts all strings have either two 1 or three 0.​
0