Teori Bahasa dan Automata Quiz

What is meant by the alphabet in the Theory of Languages and Automata?

• A finite set of symbols.

• An infinite sequence of symbols.

• A production rule in grammar.

• A language recognized by an automaton.

Which type of grammar generates languages that can be recognized by Finite Automata?

• Regular Grammar

• Context-Free Grammar

• Context-Sensitive Grammar

• Unrestricted Grammar

The main limitation of Finite Automata (FA) is...

• Having unlimited memory.

• Not having memory.

• Only having a limited number of states.

• Can solve any computational problem.

Which of the following languages is NOT a regular language?

• L={anbn∣n≥0}

• L={a,b}∗

• L={an∣n≥0}

• L={ab}∗

The main function of Regular Expressions is...

• Used to define regular languages.

• Used to define context-free languages.

• A type of automaton.

• Can only recognize binary strings.

In the formal definition of Finite Automata, what is the role of the transition function (δ)?

• Determines whether a string is accepted by the automaton.

• Determines the initial state of the automaton.

• Determines the final state of the automaton.

Which finite automaton has exactly one transition for each pair of state and input symbol?

• Deterministic Finite Automaton (DFA).

• Non-deterministic Finite Automaton (NFA).

• Pushdown Automaton (PDA).

• Turing Machine (TM).

What additional feature does Pushdown Automaton (PDA) have compared to Finite Automata?

• Has stack memory.

• Does not have memory.

• Only has limited states.

• Uses unlimited tape.

In practical applications, the concepts of the Theory of Languages and Automata are most commonly used in the development of...

• Compilers.

• Database Management Systems.

• Operating Systems.

• Web Browsers.

What makes Turing Machines more powerful in computation compared to Pushdown Automata?

• Non-deterministic.

• Has unlimited tape memory.

• Only recognizes regular languages.

• Does not have states.