Unit 2 - Regular Languages And Finite Automata

Reviewed by Editorial Team
The ProProfs editorial team is comprised of experienced subject matter experts. They've collectively created over 10,000 quizzes and lessons, serving over 100 million users. Our team includes in-house content moderators and subject matter experts, as well as a global network of rigorously trained contributors. All adhere to our comprehensive editorial guidelines, ensuring the delivery of high-quality content.
Learn about Our Editorial Process
| By Jinal_parmar
J
Jinal_parmar
Community Contributor
Quizzes Created: 1 | Total Attempts: 628
| Attempts: 631
SettingsSettings
Please wait...
  • 1/11 Questions

    A language is regular if and only if

    • Accepted by DFA
    • Accepted by PDA
    • Accepted by LBA
    • Accepted by Turing machine
Please wait...
About This Quiz

This quiz focuses on Regular Languages and Finite Automata, assessing knowledge on state requirements, language types, and limitations of finite automata. It tests understanding of regular expressions and transition function mapping, crucial for students of computer science.

Unit 2 - Regular Languages And Finite Automata - Quiz

Quiz Preview

  • 2. 

    Regular expressions that do not contain the star operator can represent only finite languages.

    • True

    • False

    Correct Answer
    A. True
    Explanation
    Regular expressions are a way to describe patterns in strings. The star operator (*) in regular expressions allows for repetition of a character or group of characters. If a regular expression does not contain the star operator, it means that it cannot represent infinite repetition. Therefore, it can only represent a finite language, as it can only describe patterns that have a finite number of possible strings. Hence, the statement "Regular expressions that do not contain the star operator can represent only finite languages" is true.

    Rate this question:

  • 3. 

    Regular expressions are closed under

    • Union

    • Intersection

    • Kleen star

    • All of the mentioned

    Correct Answer
    A. All of the mentioned
    Explanation
    Regular expressions are closed under all of the mentioned operations, which means that the result of applying any of these operations to regular expressions will always produce another regular expression. This property is important in computer science and formal language theory as it allows for the manipulation and combination of regular expressions to create more complex patterns and expressions.

    Rate this question:

  • 4. 

    Number of states require to accept string ends with 10.

    • 3

    • 2

    • 1

    • Can’t be represented.

    Correct Answer
    A. 3
    Explanation
    To accept a string that ends with "10", we need to consider the possible combinations of states that can lead to this ending. In this case, we can have three states: the initial state, a state that accepts "1", and a final state that accepts "0". The initial state transitions to the state that accepts "1", and the state that accepts "1" transitions to the final state that accepts "0". Therefore, we need three states to accept a string that ends with "10".

    Rate this question:

  • 5. 

     Which of the following are not regular ?

    • String of 0's whose length is a perfect square

    • Set of all palindromes made up of 0's and 1's

    • Strings of 0's, whose length is a prime number

    • All of these

    Correct Answer
    A. All of these
    Explanation
    The correct answer is "All of these". None of the given options are regular languages. A regular language can be recognized by a finite automaton, but none of the given languages can be recognized by a finite automaton. The language of strings of 0's whose length is a perfect square is not regular because it requires counting and checking if the length is a perfect square. The language of palindromes made up of 0's and 1's is not regular because it requires matching characters at opposite ends of the string. The language of strings of 0's whose length is a prime number is not regular because it requires checking if the length is a prime number. Therefore, all of these languages are not regular.

    Rate this question:

  • 6. 

    Transition function maps. 

    • Σ * Q -> Σ

    • Q * Q -> Σ

    • Σ * Σ -> Q

    • Q * Σ -> Q

    Correct Answer
    A. Q * Σ -> Q
    Explanation
    The transition function maps a state (Q) and an input symbol (Σ) to a new state (Q). In other words, when the automaton is in a certain state and receives a certain input symbol, the transition function determines the next state that the automaton will transition to. Therefore, the correct answer is Q * Σ -> Q, where Q represents the set of states and Σ represents the set of input symbols.

    Rate this question:

  • 7. 

    Which one do you like?

    • Option 1

    • Option 2

    • Option 3

    • Option 4

    Correct Answer
    A. Option 1
  • 8. 

    Finite automata requires minimum _______ number of stacks. 

    • 1

    • 0

    • 2

    • 3

    Correct Answer
    A. 0
    Explanation
    Finite automata requires minimum 0 number of stacks because it operates on a finite set of states and does not require any additional memory to keep track of its current state. It can be implemented using a simple control unit that transitions between states based on the input received, without the need for any stack data structure.

    Rate this question:

  • 9. 

    The basic limitation of finite automata is that

    • It can’t remember arbitrary large amount of information.

    • It sometimes recognize grammar that are not regular.

    • It sometimes fails to recognize regular grammar

    • All of the mentioned

    Correct Answer
    A. It can’t remember arbitrary large amount of information.
    Explanation
    Finite automata have a limited memory capacity, which means they cannot remember an arbitrary large amount of information. This limitation is due to the fact that finite automata have a fixed number of states and can only store a finite amount of information in these states. Therefore, when faced with complex problems or inputs that require remembering a large amount of information, finite automata are unable to effectively solve or process them.

    Rate this question:

  • 10. 

    Regular expression for all strings starts with ab and ends with bba is. 

    • Aba*b*bba

    • Ab(ab)*bba

    • Ab(a+b)*bba

    • All of the mentioned

    Correct Answer
    A. Ab(a+b)*bba
    Explanation
    The regular expression "ab(a+b)*bba" represents all strings that start with "ab" and end with "bba". The "a" after "ab" allows for zero or more occurrences of "a" in between. The "(a+b)*" allows for zero or more occurrences of either "a" or "b" in between. Finally, "bba" ensures that the string ends with "bba". Therefore, this regular expression covers all possible strings that meet the given criteria.

    Rate this question:

  • 11. 

    Language of finite automata is.

    • Type 0

    • Type 1

    • Type 2

    • Type 3

    Correct Answer
    A. Type 3
    Explanation
    The language of finite automata is Type 3. Type 3 languages are also known as regular languages, which can be recognized by finite automata. These languages can be described by regular expressions or generated by regular grammars. They are the simplest type of languages in the Chomsky hierarchy and can be represented by deterministic or non-deterministic finite automata.

    Rate this question:

Quiz Review Timeline (Updated): Mar 21, 2023 +

Our quizzes are rigorously reviewed, monitored and continuously updated by our expert board to maintain accuracy, relevance, and timeliness.

  • Current Version
  • Mar 21, 2023
    Quiz Edited by
    ProProfs Editorial Team
  • Jan 05, 2017
    Quiz Created by
    Jinal_parmar
Back to Top Back to top
Advertisement
×

Wait!
Here's an interesting quiz for you.

We have other quizzes matching your interest.