Back to marketplace
Regular Language
No description yet. This curated deck is ready for daily study.
Total cards: 10•Content version: v4•Public deck•Updated: 8/1/2026
Card preview (10)
#1
Front (Question)
what does this mean *
Back (Answer)
0 or more repetition
#2
Front (Question)
what does this mean +
Back (Answer)
1 or more repition
#3
Front (Question)
what does this mean ?
Back (Answer)
Previous character is optional
#4
Front (Question)
what does this mean |
Back (Answer)
alternative or or
#5
Front (Question)
what does this mean ()
Back (Answer)
grouping regular experession together
#6
Front (Question)
What is a set
Back (Answer)
unordered unique values
#7
Front (Question)
0^n 1^n | n> 1
Back (Answer)
01 , 0011, 000111
#8
Front (Question)
All regular languages can be represented using a finite state machine without outputs true or false
Back (Answer)
True
#9
Front (Question)
The set of strings defined by a regular language is always finite in size.
Back (Answer)
False
#10
Front (Question)
There are some languages which can be represented in Backus-Naur Form (BNF) that are not regular languages
Back (Answer)
True