Deterministic context-free language is closed under..............

According to Chomsky classification, the language of finite Automata is:

What is the correct production rule for the language L={a^mbⁿ |m<n, m ≥1}?

In Automata theory, a production without any restriction is called............... production.

The language {aⁿbⁿcⁿ |n ≥1} is:

Which of the following is done by attaching rules or program fragments to productions in grammar?

The concatenation of two regular expressions R₁ and R2 is represented using:

A grammar that produces more than one leftmost derivation or more than one rightmost derivation for the same sentences is known as...............

Every monotonic grammar is a...............grammar.

The logic of pumping lemma is an example of...........

Pushdown automata can recognize language generated by.........

Given the language L={ab, aa, baa}, which of the following strings are in L*?

Output depends upon both present state and presents input in ..................machine.

If L1 and L2 are regular languages, then L1.L2 will be

Every grammar in Chomsky Normal form is

The language accepted by pushdown Automaton....................language.

If L1 and L2 are regular sets then the intersection of these two will be

Which technique can be used to prove that a language is non-regular?

In a grammar .............. is used to represent production rules.

For each input symbol, a machine that can move on many states is called..........

An Automata can be represented by.......tuples.

FSM whose output depends only on the present state...............machine.

∑ is a finite set of.............

DFA stands for: