Regular Expressions and Finite Automata
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 … Read more