Скачать или смотреть Lecture 19:Construction of Non-Deterministic Finite Automata (NFA Examples)

#ConstructionofNFA, #NFAExamples #FiniteAutomata #TheoryofComputation #TOC #NFA

Construct a NFA that accepts set of all strings starting with 1.
Construct a NFA that accepts set of all strings ending with 01.
Construct a NFA that accepts set of all strings that contains 01 as a substring.
Construct a NFA that accepts set of all strings that contains three consecutive 0's.
Construct a NFA that accepts set of all strings that starts with 0 and ends with 1.
Construct a NFA that accepts set of all strings that starts and ends with same symbol.
Construct a NFA that accepts set of all strings that contains 01 or 10 as a substring.
Construct a NFA that accepts set of all strings whose 3rd last symbol is 1.
Construct a NFA that accepts set of strings {0,01,10,101,111}.