A regular language over an alphabet ? is one that cannot be ...

MCQ

A regular language over an alphabet ? is one that cannot be obtained from the basic languagesusing the operation

Union

Concatenation

Kleene*

All of the mentioned

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

If ? = {a, b, c, d, e, f} then number of strings in ? of length 4 such that no symbol is used more than once in a string is

360

720

Discussion

MCQ

Consider the following two statements.

S1: { 02n |n >= l} is a regu1ar language
S2: { 0m 0n 0(m+n) l m >= 1 and n >= 2} is a regu1ar language

Which of the following is true?

Only S1 is correct

Only S2 is correct

Both S1 and S2 are correct

None of S1 and S2 is correct

Discussion

MCQ

A regular language over an alphabet ? is one that cannot be obtained from the basic languagesusing the operation

Union

Concatenation

Kleene*

All of the mentioned

Discussion

MCQ

A language L from a grammar G = { VN, ?, P, S} is?

Set of symbols over VN

Set of symbols over ?

Set of symbols over P

Set of symbols over S

Discussion

MCQ

Languages of a automata is

If it halts

If it is accepted by automata

If automata touch final state in its life time

All language are language of automata

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Compiler Design Topics

Compiler Design Basics

Non Deterministic Finite Automata

Lexical Analysis

Regular Expressions

Finite Automata

Syntax Analyser

Semantic Analyser

Run Time Environment

Code Generation

Code Optimization

Parsing

Transformation from NFA to DFA

Cross Compiler

Epsilon Moves

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Compiler Design Topics

Compiler Design Basics

Non Deterministic Finite Automata

Lexical Analysis

Regular Expressions

Finite Automata

Syntax Analyser

Semantic Analyser

Run Time Environment

Code Generation

Code Optimization

Parsing

Transformation from NFA to DFA

Cross Compiler

Epsilon Moves

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Compiler Design Topics