PUT THIS IN bolDFAce
THE EMPTY STRING IS REPRESENTED BY THIS GREEK CHARACTER
What is epsilon?
SINGULAR FORM OF AUTOMATA
What is automaton?
THE MEANING OF * IN REGULAR EXPRESSIONS
What is 0 or more occurrences of the character(s)?
ALL REGULAR LANGUAGES CAN BE PUMPED IF THEY ARE AT LEAST AS LONG AS THIS SPECIAL VALUE
What is the pumping length?
What is false?
PICTORIAL REPRESENTATION OF A DFA
What is a state diagram?
WHEN CONVERTING AN NFA TO AN DFA, THE STATES OF THE DFA ARE COMPOSED OF THESE
What are subsets of the states?
What is R+?
IN THE PUMPING LEMMA, THE LENGTH OF THIS MUST BE <= P
WHAT IS xy?
IN THE PUMPING LEMMA, THE STRING y^i CAN BE EPSILON
What is true?
THE EMPTY LANGUAGE IS REPRESENTED BY THIS CHARACTER
What is null?
A MOVE TO A NEW STATE IN AN NFA MAY BE MADE WITHOUT CONSUMING AN INPUT CHARACTER IF THE ARC IS LABELED WITH THIS
What is epsilon?
THE LANGUAGE DESCRIBED BY THE REGULAR EXPRESSION (SIGMA SIGMA)*
What are strings of even length?
TO CUT A STATE OF A GNFA, THE REGULAR EXPRESSION COMPOSED OF R1, R2, R3, AND R4 IS THIS
What is R1R2*R3 U R4?
SOME REGULAR LANGUAGES CANNOT BE REPRESENTED WITH AN NFA
What is false?
GRAPHICAL INDICATION OF ACCEPT STATE
What is a double circle?
WHILE A DFA HAS EXACTLY ONE EXITING ARROW FOR EACH SYMBOL, AN NFA MAY HAVE THESE NUMBERS
What is zero, one, or many?
THE EXPRESSION EQUIVALENT TO NULL*
What is {epsilon}?
TYPE OF PROOF USING THE PUMPING LEMMA TO SHOW A LANGUAGE IS NON-REGULAR
What is a proof by contradiction?
SOME LANGUAGES PASS THE PUMPING LEMMA TEST EVEN THOUGH THEY ARE NONREGULAR
What is true?
ELEMENTS OF THE DFA 5-TUPLE IN ORDER
What are Q (set of states), Sigma (alphabet), Delta (transitions), Start state, and Accept state?
THREE OPERATIONS UNDER WHICH REGULAR EXPRESSIONS ARE CLOSED
What are union, concatenation, and star?
WHEN CONVERTING A DFA TO A REGULAR EXPRESSION, WE USE THIS TYPE OF AUTOMATON
What is a GNFA?
COMMON STRING WITH 0 AND 1 USED TO PROVE A LANGUAGE IS NON-REGULAR
What is 0^n1^n?
EVERY DFA MUST HAVE AN ACCEPT STATE
What is false?