This exercise is to generate a language and a finite automata to process the language. The language must have the following properties: 1. The alphabet (sigma) for the language can contain no more than 3 characters. 2. The language must be defined using 'begins with','ends with', and/or 'contains (substring)' elements. An example, which you cannot use, is "L is all strings over {a,b}* that ends in 'a' and contains 'bb'" 3. The language must be unique and cannot only be different by changing the alphabet. So for example the language: "L is all strings over {x,y]* than ends in 'y' and contains 'xx'" would be considered the same language as the one defined in step 2 above. After defining your language, draw the finite automata that properly processes your language. I suggest picking a longer strings of 'begin/ends/contains' characters. It'll be easier to meet all the criteria with a longer strings even though it takes a bit more work to generate the automata
This exercise is to generate a language and a finite automata to process the language.
The language must have the following properties:
1. The alphabet (sigma) for the language can contain no more than 3 characters.
2. The language must be defined using 'begins with','ends with', and/or 'contains (substring)' elements. An example, which you cannot use, is
"L is all strings over {a,b}* that ends in 'a' and contains 'bb'"
3. The language must be unique and cannot only be different by changing the alphabet. So for example the language:
"L is all strings over {x,y]* than ends in 'y' and contains 'xx'" would be considered the same language as the one defined in step 2 above.
After defining your language, draw the finite automata that properly processes your language.
I suggest picking a longer strings of 'begin/ends/contains' characters. It'll be easier to meet all the criteria with a longer strings even though it takes a bit more work to generate the automata.
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
