I did following exercise and i want to clarify that did i made something wrong. And cannot figure out how to solve the c th question.
answers that i got
2026-03-25 07:47:57.1774424877
Want to clarify and check DFA and NFA attempt
113 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
2
There are 2 best solutions below
Related Questions in COMPUTER-SCIENCE
- What is (mathematically) minimal computer architecture to run any software
- Simultaneously multiple copies of each of a set of substrings of a string.
- Ackermann Function for $(2,n)$
- Algorithm for diophantine equation
- transforming sigma notation into harmonic series. CLRS A.1-2
- Show that if f(n) is O(g(n) and d(n) is O(h(n)), then f(n) + d(n) is O(g(n) + h(n))
- Show that $2^{n+1}$ is $O(2^n)$
- If true, prove (01+0)*0 = 0(10+0)*, else provide a counter example.
- Minimum number of edges that have to be removed in a graph to make it acyclic
- Mathematics for Computer Science, Problem 2.6. WOP
Related Questions in AUTOMATA
- Exitstance of DPA of L = $\{ww^r\}$
- Automata defined by group presentations.
- How to prove convergence of a sequence of binary numbers
- A finite automaton that accepts at least three $a$s and at least two $b$s.
- Is my DFA correct?
- Intersection of two languages (Formal Languages and Automata Theory)
- Is there any universal algorithm converting grammar to Turing Machine?
- Build a Context-Free Grammar for a given language
- Prove that $B = B ^+$ iff $BB \subseteq B$
- Proving a Language is Regular via Automata
Related Questions in REGULAR-EXPRESSIONS
- Constructing context free grammar with a number constraint to one of the elements in the language
- Converting CFG to a regular expression
- Formally expressing regular expression
- Regular expression: At least two a's and doesn't end in bb
- Prove that $B = B ^+$ iff $BB \subseteq B$
- Prove a language is not regular. Use pumping lemma.
- The two regular expressions abc and abc(φ)* are equivalent. (T/F)
- Find an automaton that recognizes this language
- Find language generated by a regular grammar
- Regular expression for roman numerals
Related Questions in FINITE-AUTOMATA
- Infinite strings and infinite theorems - Is there a theory on these stuffs?
- For any regular expression for a finite automata, how do you find the shortest word accepted?
- Converting NFA to DFA and then to regular expression.
- Divisibility problem using DFA
- Epsilon and phi in automata
- Did I find the right expression for the regular language for this FSA?
- Context free grammar to NFA
- Unable to construct Context-free Grammar from Pushdown Automaton $a^n b^m$
- CFG and Regularity of Two Language?
- Show that A/B is regular.
Related Questions in AUTOMATED-THEOREM-PROVING
- Automated proof verification of metalogical theorems of first order logic
- Why is there not a system for computer checking mathematical proofs yet (2018)?
- Should $\to$-elimination always have precedence over $\lnot$-elimination when transforming formulas to Prenex CNF?
- Problem with transforming a formula to Prenex CNF
- Transforming a formula into clausal form
- Who to define the meta-function using induction prinicple?
- First Order Logic knowledge base problem
- Can all classical math proofs be represented in type theory?
- Curry-Howard for an imperative programming language?
- Are "Discovery Systems" still not viable in mathematics?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
I afraid that your answer for (a) is incorrect... Check for example that the word $w = 111$ is accepted by your automata, but $n_1(w) = 0 \pmod{3}$.
Label the states in your answer to (a) as: $$q_0: n_1(w) = 0 \pmod{3}$$ $$q_1: n_1(w) = 1 \pmod{3}$$ $$q_2: n_1(w) = 2 \pmod{3}$$ and try to figure out for each arrow where it should go, what will be the states of $w$.
Here is a NFA for (c):