Business Studies, asked by yogsadhana1304, 1 month ago

A language accepted by
Deterministic Push down automata
is closed under which of the
following?​

Answers

Answered by ParneetKaur1111
0

Answer:

Deterministic Context free languages(one accepted by PDA by final state), are drastically different from the context free languages. For example they are closed under complementation and not union.

Previous Question
Next Question
Similar questions
Physics, 17 days ago
Explain magnatic poles in your own words​...
Science, 17 days ago
Unscramble the following to form terms related to mode of nutrition and write a short note on it.1) LYLOHOPRLHC 2) NOTTIIURN 3) SEOONMIEVR please tell me the answer​...
Computer Science, 17 days ago
B T E Y jumble word. ​
Math, 1 month ago
25+(-14÷2) x(-3x -6) solve using bodmas​...
English, 1 month ago
Elements NaOH + H2SO4 -Na2SO4+H₂O ​...
English, 8 months ago
paragraph on a merry heart does good like medicine but a broken spirit dries the bone​ In 120 words...
Math, 8 months ago
find the quadratic polynomial​...
English, 8 months ago
India’s coronavirus (COVID-19) lockdown is having a dramatic impact on pollution– write an article in 120-150 words on the above topic.