Flashcards
Unit 3
Cards in this deck (2)
- 1Is it possible that a regular grammar (RG) generates a language not representable by a RE ?No, a regular grammar generates reuglar languages can always be
represented by a RE. - 2Given a and b, elements of an alphabet: Is (a+b)* = ((a+b)*)+ ?Yes, the first term includes all possible string to be formed by a & b,
including the empty string, the strict closure on the left hand side is not
going to add any new string.
Information
- Description
- Flashcards on Unit 3, created by Nicolás Lerible García on 02/11/2021.
- Created by
- Nicolás Lerible García
- Views
- 0
- Rating