Питання | Сторінка 2160

Which of the following languages cannot be accepted by any PDA?

{ aⁿbⁿcⁿ | n ≥ 0 }

100%

{ wwᴿ | w ∈ {a,b}* }

0%

{ aⁱbʲ | i ≥ j }

0%

{ aⁿbⁿ | n ≥ 0 }

0%

Переглянути це питання

Two DFAs accepting the same language must have:

Identical transition functions

0%

Same number of states

0%

Same start state

0%

Isomorphic minimal DFAs

100%

Переглянути це питання

If a CNF grammar generates a string of length 1, then:

It violates CNF

0%

it requires ε-production

0%

It must use exactly one production A → a

100%

It must use two productions

0%

Переглянути це питання

Which of the following languages is inherently ambiguous?

{ wwᴿ | w ∈ {a,b}* }

0%

{ aⁱbʲ | i ≥ j }

0%

{ aⁿbⁿ | n ≥ 0 }

0%

{ aⁱbʲcᵏ | i = j or j = k }

100%

Переглянути це питання

A CFG in Greibach Normal Form (GNF) ensures:

No ambiguity

0%

All productions are binary

0%

all

0%

Every production begins with a terminal

100%

Переглянути це питання

Mia voudrait voir la position réelle de ses annonces ainsi que celles de ses concurrents directs. Quel outil suggérez-vous à Mia d'utiliser parmi les suivants :

Outil de planification d'audiences

0%

Prévisualisation et diagnostic des annonces

100%

Google Analytics

0%

Données d'entreprise

0%

Переглянути це питання

Which language cannot be accepted by any DFA with fewer than 4 states?

Strings starting with 0

100%

Strings ending with 01

0%

Strings where the number of 1s is divisible by 3

0%

Strings containing substring 11

0%

Переглянути це питання

Which automaton accepts exactly the language described by a regular expression?

Both DFA and NFA

100%

DFA only

0%

NFA only

0%

Pushdown automaton

0%

Переглянути це питання

The ε-closure of a state q includes:

All states reachable using any input

0%

All states reachable from q using exactly one ε-move

0%

Only q

0%

All states reachable from q using ε-moves only

100%

Переглянути це питання

In CNF conversion, unit productions are removed by:

Substituting terminals only

0%

Removing all non-terminals

0%

Replacing A → B by adding all productions of B to A

100%

Переглянути це питання

Crowdly

Questions Bank (1505563 total)