Theory of Computation (Automata)
What term describes the following? a set of strings composed of symbols from a defined alphabet.
Difficulty: Medium
About this MCQ
This Medium Theory of Computation (Automata) MCQ checks one syllabus fact.
The question is: “What term describes the following? a set of strings composed of symbols from a defined alphabet.”
The accepted answer is D. Formal language. Formal language refers to a set of strings composed of symbols from a defined alphabet.
- A. Kleene star
Why not A: “Kleene star” is not correct. The accepted answer is D. Formal language. Formal language refers to a set of strings composed of symbols from a defined alphabet.
- B. Context-sensitive language
Why not B: “Context-sensitive language” is not correct. The accepted answer is D. Formal language. Formal language refers to a set of strings composed of symbols from a defined alphabet.
- C. Recursively enumerable language
Why not C: “Recursively enumerable language” is not correct. The accepted answer is D. Formal language. Formal language refers to a set of strings composed of symbols from a defined alphabet.
- D. Formal language ✓
Correct answer
D. Formal language
Explanation
Formal language refers to a set of strings composed of symbols from a defined alphabet.
Source: Theory of Computation (Automata) Official Reference Guide
Tags: computer science, automata theory, theory of computation, formal languages
Submitted by: MCQsHub Editorial
Related MCQs
- The concept in which a finite sequence of symbols drawn from an alphabet is best known as which of these terms...
- Identify the correct definition of String (formal language).
- In computer science, Formal language refers to which of the following?
- Select the correct name for: an operation on a set of symbols or strings that produces the set of all possible...
- Which statement correctly explains Kleene star?
- Which concept is defined as follows: a transition in a non-deterministic automaton that occurs without consumi...