Preview Odd

  • Terminals:
    • Any character from the alphabet is a terminal
    • ε is expressed as: \e, \eps or \epsilon
    • The empty set is expressed as: \emp or \emptyset
  • Operations (R is a regular expression):
    • Union is expressed as R|R
    • Star as R*
    • Concatenation as RR
    • Plus as R+

Problem

Construct a regular expression that recognizes the following language of strings over the alphabet { 0 1 }:

All binary strings (most-significant bit first) representing odd numbers. Leading 0's are allowed.