Regular Language

Question 1

what does this mean *

Answer 1

0 or more repetition

Question 2

what does this mean +

Answer 2

1 or more repition

Question 3

what does this mean ?

Answer 3

Previous character is optional

Question 4

what does this mean |

Answer 4

alternative or or

Question 5

what does this mean ()

Answer 5

grouping regular experession together

Question 6

What is a set

Answer 6

unordered unique values

Question 7

0^n 1^n | n> 1

Answer 7

01 , 0011, 000111

Question 8

All regular languages can be represented using a finite state
machine without outputs true or false

Answer 8

True

Question 9

The set of strings defined by a regular language is always
finite in size.

Answer 9

False

Question 10

There are some languages which can be represented in
Backus-Naur Form (BNF) that are not regular languages

Answer 10

True