Skip to main content
 logo
  • Home
  • Classrooms
  • Quiz
  • Blog
  • More
    • Reach us
      • Contact Us
      • Internship
    • About
      • About Techtud
Theory of Computation
  • Introduction
    • What is Theory of Computation
    • Basic Terms
      • Alphabet
      • String
      • Language
      • Kleene Star
      • Kleene Closure/Plus
  • Automata
    • Deterministic Finite Automata
    • Non Deterministic Finite Automata(NFA)
    • DFA Vs. NDFA
    • NFA to DFA Coversiation
    • DFA Minimization
  • Classification of Grammar
    • Introduction
    • Language Generated by Grammar
    • Chomsky Classification of Grammar
  • Regular Languages
    • Closure Properties of Regular Language
    • Regular Expressions
      • NFA for a Regular Expression
      • Regular Expression for an NFA
    • Pumping Lemma for Regular Languages
  • Context Free Languages
    • Context Free Grammars
    • Pumping Lemma for CFLs
    • Push Down Automata
  • Context Sensitive Languages
    • Context Sensitive Grammars
    • Linear Bounded Automata for CFLs
  • Turing Machines
    • Automata for Turing Machines
    • Church Turing Thesis
    • The Chomsky Hierarchy
    • The Machine
    • Types of Turing Machines
    • Unrestricted Grammars
  • Decidability
  • Notes
  • Video
  • Example
  • Resource
  • Doubts
  • Quiz
Previous
Next
  • A
  • Akshaya Kumar Biswal @akshayakumarbis  added a Short note
    28 Jul 2018
Kleene Star | Theory of Computation

 

  • Definition − The Kleene star, ∑*, is a unary operator on a set of symbols or strings, ∑, that gives the infinite set of all possible strings of all possible lengths over ∑ including λ.
  • Representation − ∑* = ∑0 ∪ ∑1 ∪ ∑2 ∪……. where ∑p is the set of all possible strings of length p.
  • Example − If ∑ = {a, b}, ∑* = {λ, a, b, aa, ab, ba, bb,………..}
0Comment
up
0 like

Quick Links

  • Terms and Services

About

  • About Techtud

Reach us

  • Contact Us
  • Join Us

Media Coverage

TOI
YS
BS

Subscribe

Proudly supported by OpenSense Labs