University of Central Florida Regular Expressions and Finite Automata Questions
Question Description
Hi I have this homework
- Which one of the following is true about regular languages?
- A regular language can contain an infinite number of strings
- A regular language must contain an finite number of strings
- A regular language can parse a context-free grammar
- A regular language cannot be expressed with regular expressions
- Write 3 strings that this regular expression matches((b|c)a(d|t))*
- Write a regular expression for the following language description: zero or more letters “a” followed by either letter “c” or letter “d”.
- Convert this regular expression to a nondeterministic finite automaton (NFA)(aba|bab)*c
- Convert the NFA above into a deterministic finite automaton (DFA)
Have a similar assignment? "Place an order for your assignment and have exceptional work written by our team of experts, guaranteeing you A results."