adplus-dvertising
frame-decoration

Question

Which of the following correctly resembles the given state diagram?

a.

{ww^r|w=(a+b)*}

b.

ε is called the initial stack symbol

c.

Both (a) and (b)

d.

None of the mentioned

Posted under Formal Languages and Automata Theory

Answer: (a).{ww^r|w=(a+b)*}

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Which of the following correctly resembles the given state diagram?
Add Comment

Similar Questions

Discover Related MCQs

Q. A push down automaton employs ________ data structure.

View solution

Q. State true or false:
Statement: The operations of PDA never work on elements, other than the top.

View solution

Q. Which of the following allows stacked values to be sub-stacks rather than just finite symbols?

View solution

Q. A non deterministic two way, nested stack automaton has n-tuple definition. State the value of n.

View solution

Q. Push down automata accepts _________ languages.

View solution

Q. The class of languages not accepted by non deterministic, nonerasing stack automata is _______

View solution

Q. A push down automaton with only symbol allowed on the stack along with fixed symbol.

View solution

Q. Which of the operations are eligible in PDA?

View solution

Q. A string is accepted by a PDA when

View solution

Q. The following move of a PDA is on the basis of:

View solution

Q. If two sets, R and T has no elements in common i.e. RÇT=Æ, then the sets are called

View solution

Q. Which among the following is not a part of the Context free grammar tuple?

View solution

Q. A context free grammar is a ___________

View solution

Q. The closure property of context free grammar includes :

View solution

Q. Which of the following automata takes stack as auxiliary storage?

View solution

Q. Which of the following automata takes queue as an auxiliary storage?

View solution

Q. A context free grammar can be recognized by

View solution

Q. A null production can be referred to as:

View solution

Q. The context free grammar which generates a Regular Language is termed as:

View solution

Q. NPDA stands for

View solution
View All MCQs on Formal Languages and Automata Theory

Suggested Topics

Are you eager to expand your knowledge beyond Formal Languages and Automata Theory? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!

Computer Graphics

Step into the visual side of computing with our Computer Graphics MCQs. Cover topics...

Formal Languages and Automata Theory

Discover the mathematical models of computation with our Formal Languages and...

C Programming

Master one of the most widely used programming languages with our C Programming MCQs....

Compiler Design

Unravel the process of translating source code into executable programs with our...

Cryptography and Network Security

Secure your knowledge of information security with our Cryptography and Network...

Digital Image Processing (DIP)

Delve into the techniques of enhancing digital images with our Digital Image...

MongoDB

Learn the leading NoSQL database with our MongoDB MCQs. Understand everything from...

Cyber Security

Understand the fundamentals of safeguarding digital assets with our Cyber Security...

Software Engineering

Learn about the systematic approach to developing software with our Software...