Question

A finite automata that will accept only string X of length n will have
many states​

Answer 1

Answer:

$\huge\boxed{\fcolorbox{lime}{yellow}{⭐Answer☆☺⤵࿐}}$

Leaving out the somewhat ridiculous and sometimes shameful religious slant towards this question, you would think that the purpose of humans is to find ways to work cooperatively to maintain the earth and its resources so that all of us have clean water and air, comfortable housing and clothing, adequate healthcare, and equal opportunities for work and education, and amenities such as transportation, communication, entertainment, and recreation. We should be able to do all this without polluting or spoiling the earth, which is, of course, the mother of all of us.

Answer 2

Answer:

A string is accepted by a DFA, if it transits to a final state. A string is accepted by a NDFA, if at least one of all possible transitions ends in a final state.

Explanation:

The term "Automata" is derived from the Greek word "αὐτόματα" which means "self-acting". An automaton (Automata in plural) is an abstract self-propelled computing device which follows a predetermined sequence of operations automatically.

An automaton with a finite number of states is called a Finite Automaton (FA) or Finite State Machine (FSM).

Formal definition of a Finite Automaton

An automaton can be represented by a 5-tuple (Q, ∑, δ, q0, F), where −

Q is a finite set of states.

∑ is a finite set of symbols, called the alphabet of the automaton.

δ is the transition function.

q0 is the initial state from where any input is processed (q0 ∈ Q).

F is a set of final state/states of Q (F ⊆ Q).

For similar questions refer-https://brainly.in/question/3866687

#SPJ5