Theory of Automata (Test 1)

Which of the following best describes a formal language?

• A language used in everyday communication.

• A language that is defined by a precise mathematical set of rules.

• A language that evolves over time with no fixed structure.

• A language understood only by computers.

What is an informal language?

• A language strictly used in programming.

• A formal language with a set of defined rules.

• A language with ambiguous syntax and semantics.

• A language that can only be processed by machines.

Which of the following is NOT a language in the context of automata?

• {a, b, ab, aba}

• {0, 1}*

• {x | x is a string of characters}

• "Hello World"

What does the regular expression a(b|c)* denote?

• A string that starts with 'a' followed by zero or more 'b' or 'c'.

• A string that consists only of 'a's.

• A string that can contain 'a', 'b', or 'c' in any order.

• A string of 'b's or 'c's only.

In the context of formal languages, an alphabet is:

• A collection of natural numbers.

• A finite set of symbols.

• A sequence of characters.

• A dictionary of words.

Which of the following is an example of a string?

• {a, b, c}

• aabbcc

• (a|b)

• {0, 1}

What is a "string" in the context of automata theory?

• A series of numbers.

• A finite sequence of symbols from an alphabet.

• An infinite collection of characters.

• A programming command.

If Σ = {0, 1}, which of the following strings is NOT in the language defined by the regular expression 0(0|1)*1?

• 01

• • 001

• 011

• 10

Which of the following is an example of a formal language?

• English

• C++

• Morse Code

• Sign Language

Informal languages are typically characterized by:

• Strict grammatical rules.

• Ambiguity and flexibility.

• • Rigorous definitions.

• Limited vocabulary.