The order of operations for regular expressions, from highest priority to lowest, is

1. Choice: |

2. Kleene star: *

3. Concatenation

4. Parentheses: ( )

Which is not true? O Every FSA has an alphabet 2. Every FSA has a single accepting state sA E Every FSA has a state change function : SxE S. OEvery FSA has a single starting state so E S QUESTION 16 suppose that we have a state change diagram for a finite state automaton which contains an edge (83, 83) with label ?. This means: O The FSA cannot enter the state s3 regardless of the input Once the FSA is in state s3, it will remain in s3 regardless of the input O This is an invalid state change diagram, since directed graphs do not allow loops OIn order to enter state s the FSA must receive an input symbol in the complement of QUESTION 17 The lectures claimed that all real computers are essentially finite state automata. This means that they can only recognise reular languages, and yet we routinely use non-regular languages such as Python. The best explanation for this is: Python is in fact regular. We can see this from the fact that computers can recognise them! The problem is that Python requires paratheses be matched, but we know that this is not regular. However, computers can easily count parentheses so this is not a problem. The lecturer doesn't know what he's talking about. Real computers are in fact not finite state automata. For example, computers can store real numbers which requires an infinite amount of information, which breaks the FSA model. However, FSAs are still a good approximation if we forget about real numbers. O Real computers are limited in memory, and hence there is an upper limit on the size of a program that they can store. This in turn means that the computer can only recognise a finite subset of all Python programs. Any finite language is regular, so the subset of Python that computers actually recognise is actually regula