answersLogoWhite

0


Best Answer

Design a pushdown automata for the same.

Otherwise, you can use the following grammer :

S -> aSb|bSa|<NULL>

User Avatar

Wiki User

13y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: How to design a finite automata to accept a palindrome no?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

What is finite Automata-compiler design?

single possible output for a given input


What you mean by Finite Automata?

Finite automata are machines used to recognize patterns from input set of characters. They either reject or accept inputs based on the already defined pattern set by the FA.


What is full form of DFA and NFA?

DFA - deterministic finite automata NFA - non-deterministic finite automata


What is the difference between deterministic finite automata and non deterministic finite automata?

A deterministic Finite Automata)DFA will have a single possible output for a given input.The answer is deterministic because you can always feel what the output will be.A (Nondeterministic Finite Automata)NFA will have at least one input which will cause a "choice" to be made during a state transition,unlike a (deterministic Finite Automata)DFA one input can cause multiple outputs for a given (Nondeterministic Finite Automata)NFA.


Applications of finite automata -text editor?

text editors can be constructed using finite automata.... one such example of text editor is MS-word.


What is difference between finite state automaton and transition graph?

finite automata


What does dfa stand for?

Deterministic finite state automata


What is dfa and nfa?

DFA - Deterministic Finite Automata NFA - Non-Deterministic Finite Automata Both DFAs and NFAs are abstract machines which can be used to describe languages.


What is better Finite Automata or Regular Expression?

Finite Automata and Regular Expressions are equivalent. Any language that can be represented with a regular expression can be accepted by some finite automaton, and any language accepted by some finite automaton can be represented by a regular expression.


Define the languages accepted by NFA and DFA?

In general, finite state machines can model regular grammars. Deterministic finite automata can represent deterministic context-free grammars. Non-deterministic finite automata can represent context-free grammars.


What is the FA?

The Football Association. Simple! wrong....... F A Means finite automata......


How can you make java program to solve finite automata?

A person can make a Java program solve Finite Automata by creating a tool with Discrete. This should be done overt a network, so that all employees have access to the programming.