Math, asked by vishnusaipvs, 5 months ago

p.d.a accepts which language in automata theory

Answers

Answered by syedaamaturraheem

Answer:

Just as DFA and nondeterministic finite automata (NFA), there are also two types of push-down automata: deterministic push-down automata (DPDA) and non-deterministic push-down automata (NPDA). The languages which can be accepted by PDA are called context-free languages (CFL), denoted by LCF.

please mark as brainliest

Previous Question

Next Question

Similar questions

Math, 2 months ago

Check whether - 152 is a term of the A.P.11 8 5 2 ... .

Math, 2 months ago

rationalize the denominator. 1/√6+√5...

Hindi, 2 months ago

अभ्यास से रामनगर में कितने विद्यालय थे? वे प्रत्येक वर्ष मिलकर कौन-सा उत्सव मनाते थे?चंचल ने सत्यपाल को अखबार बेचने का क्या उपाय दिया ...

Science, 5 months ago

when is a country said to be in the bimelatic standard ...