TOC_CSE-3_LA-1

What is a key characteristic of a Finite Automaton (FA)?

• It has an infinite number of states

• It processes input strings in a non-deterministic manner only

• It has a finite number of states and processes input strings step-by-step

• It can accept only empty strings

Which of the following best describes a Deterministic Finite Automaton (DFA)?

• An automaton where for each state and input symbol, there is exactly one next state

• An automaton that can have multiple possible next states for a given input

• An automaton that accepts input strings by guessing the correct path

• An automaton that has no defined start state

What does the “acceptance of a string” in automata theory refer to?

• The process of generating a string from an automaton

• The condition where an automaton ends in an accepting state after processing the entire input string

• The ability of an automaton to reject strings it cannot process

• The method of converting a DFA into an NFA

What distinguishes a Non-deterministic Finite Automaton (NFA) from a DFA?

• NFAs do not have start states

• NFAs can have multiple possible next states for a given input symbol

• DFAs allow epsilon (empty string) transitions, NFAs do not

• NFAs can only accept finite languages, while DFAs can accept infinite languages

Which statement about the equivalence of DFA and NFA is true?

• NFAs are strictly more powerful than DFAs

• DFAs and NFAs recognize exactly the same class of languages

• DFAs can recognize some languages that NFAs cannot

• NFAs can accept only regular languages, DFAs can accept context-free languages

One key application of finite automata is:

• Modeling continuous systems

• Parsing and lexical analysis in compilers

• Solving differential equations

• Data encryption

In the design of DFAs, what is a crucial factor to consider?

• Minimizing the number of input symbols

• Ensuring that each state has exactly one transition for each input symbol

• Allowing multiple transitions for the same input symbol from a single state

• Using non-deterministic transitions for efficiency

What is a transition system in the context of automata?

• A method to convert strings into numbers

• A structure consisting of states and transitions between those states based on inputs

• A system that only applies to infinite automata

• A technique to optimize memory usage in automata

Which of the following is true about the design of NFAs?

• NFAs cannot include epsilon (empty string) transitions

• NFAs always have fewer states than the equivalent DFA

• NFAs may have multiple possible next states or epsilon transitions for a given input

• NFAs require deterministic transitions for each input symbol

What is the primary goal of minimizing a finite automaton?

• To increase the number of states for better accuracy

• To reduce the number of states without changing the language recognized

• To convert it into a non-deterministic automaton

• To simplify the input alphabet