Please enable JavaScript.

Coggle requires JavaScript to display documents.

AutoMata, Context Free, image - Coggle Diagram

- - - - ∑- Alphabet
        σ- Letter
        w - string\word(Finite numbers of letters from the alpabet)
        ε - empty word
        .#a(w)- number of occurences of a in a word
      - operations:
        
        Reverse
        
        sub-string
        
        prefix
        
        suffix
        
        concatination
    - - L - set of words
        ∅ - empty lang (zero word)
        ∑* - all words under L
      - Types:
        
        Infinite languages
        
        Finite languages
      - Operations:
        
        reverse - reverse every word in lang
        
        concatenation (A·B)- word of A prefix. word of B suffix
        
        iteration- Concat lang's words with themself k times
        
        positive closure
        
        L* - Kleene closure - concat with itself from endless times
      - Others:
        L^0 = ε תמיד מילה ריקה
      - שפה רגולרית regular language
        היא שפה שקיים אוטומט סופי שמקבל אותה
        
        Regular Expression
        
        Operations
        
        Hierarchy
      - Infinite & Finite Language
        
        If L is finite then L is regular
        
        Infinite non-regular
        
        Finite Language
        finite number of state
- - - - Finding Equivalent States Algorithm
        
        Dividing the states into 2 groups (finite or not finite states)
        
        Splitting into groups while checking Iteration k compares to k+1.**
        
        Stop the moment k equivalent to k+1.**
        
        if two states finish in the same group ten they're equivalent