Back to marketplace
Section 9 Chapter 52 - Regular Expressions
No description yet. This curated deck is ready for daily study.
Total cards: 9•Content version: v4•Public deck•Updated: 8/1/2026
Card preview (9)
#1
Front (Question)
|
Back (Answer)
OR
#2
Front (Question)
?
Back (Answer)
Optional (preceding element)
#3
Front (Question)
*
Back (Answer)
zero or more (preceding element)
#4
Front (Question)
+
Back (Answer)
one or more (preceding element)
#5
Front (Question)
Regular Expression
Back (Answer)
A simple way to describe a set
#6
Front (Question)
Regular expression for a 0 followed by any binary string
Back (Answer)
0(0|1)+
#7
Front (Question)
Common uses of regular expressions (3)
Back (Answer)
• To match patterns to text files • By compilers to recognise syntax • By programs to validate input
#8
Front (Question)
Regular language
Back (Answer)
A language that can be represented with a regular expression (or a FSM)
#9
Front (Question)
Relationship between regular expressions and FSM
Back (Answer)
They are equivalent ways of describing a regular language