Back to the 2023 paper
Similar questions
FORMAL LANGUAGE & AUTOMATA THEORYDesign a Turing Machine that increments a binary number by 1.20247mFORMAL LANGUAGE & AUTOMATA THEORYDesign a single-tape Turing Machine that multiplies two unary numbers, where the input is of the form 1^m 0 1^n and the output is 1^{m \times n}. Clearly define the input alphabet, tape alphabet, and halting condition. Simulate the working of the Turing Machine on the input string 1101.20257mFormal Language & Automata TheoryDesign a Turing machine to perform 2's compliment operation on binary string.20197mFormal Language & Automata TheoryConstruct an NFA that will accept string of 0's, 1's and 2's beginning with a 0's followed by odd number of 1's and ending with any number of 2's.20217m
PreviousProve that if L_1 and L_2 are regular, then L_1 \cup L_2 is regular.NextGiven the \varepsilon-NFA, compute \varepsilon-closures and convert to DFA. | State | \varepsilon-transition | a-transition | b-transition | |-------|--------------------------|--------------|--------------| | → | {r} | {q} | {p,r} | | q | ∅ | {p} | ∅ | | r | {p,q} | {r} | {p} |