Notations for DFA

Notations for DFA:

Transition Diagram: 

  • This is a graph in which vertices represent state of machine and the edges show transition of states.
  • The labels on these edges indicate input/output for the corresponding transition. 

A transition diagram for a DFA M = (Q, Σ, δ, q0, F) is a graph defined as follows:

  • For each state in Q there is a node. 
  • There is labelled input symbol on transition. 
  • Then the transition diagram has an arc (arrow) from one node to another node. 
  • If multiple input symbols cause the same transition from one node to another node, then multiple input labels separated by the commas are given to that edge. 
  • There is an arrow into the start state q0 labeled as start. This arrow does not originate at any node. 
  • Final states/ accepting states are marked by concentric double circles. 
  • States not belonging to final states have a single circle. e.g.
Transition Diagram


Transition Table:

  • It specifies the resultant set of states for the corresponding current state and input to the machine.
  • A transition table is a conventional tabular representation of a function like δ that takes two arguments and returns a value the rows of the table correspond to the states and the columns correspond to the inputs. 
  • The entry for the row corresponding to state q and the column corresponding to input q is the state δ(q, a).

Python Programming ↓ 👆
Java Programming ↓ 👆
JAVA EasyExamNotes.com covered following topics in these notes.
JAVA Programs
Principles of Programming Languages ↓ 👆
Principles of Programming Languages
EasyExamNotes.com covered following topics in these notes.

Practicals:
Previous years solved papers:
A list of Video lectures References:
  1. Sebesta,”Concept of programming Language”, Pearson Edu 
  2. Louden, “Programming Languages: Principles & Practices” , Cengage Learning 
  3. Tucker, “Programming Languages: Principles and paradigms “, Tata McGraw –Hill. 
  4. E Horowitz, "Programming Languages", 2nd Edition, Addison Wesley

    Computer Organization and Architecture ↓ 👆

    Computer Organization and Architecture 

    EasyExamNotes.com covered following topics in these notes.

    1. Structure of desktop computers
    2. Logic gates
    3. Register organization
    4. Bus structure
    5. Addressing modes
    6. Register transfer language
    7. Direct mapping numericals
    8. Register in Assembly Language Programming
    9. Arrays in Assembly Language Programming

    References:

    1. William stalling ,“Computer Architecture and Organization” PHI
    2. Morris Mano , “Computer System Organization ”PHI

    Computer Network ↓ 👆
    Computer Network

    EasyExamNotes.com covered following topics in these notes.
    1. Data Link Layer
    2. Framing
    3. Byte count framing method
    4. Flag bytes with byte stuffing framing method
    5. Flag bits with bit stuffing framing method
    6. Physical layer coding violations framing method
    7. Error control in data link layer
    8. Stop and Wait scheme
    9. Sliding Window Protocol
    10. One bit sliding window protocol
    11. A protocol Using Go-Back-N
    12. Selective repeat protocol
    13. Application layer
    References:
    1. Andrew S. Tanenbaum, David J. Wetherall, “Computer Networks” Pearson Education.
    2. Douglas E Comer, “Internetworking with TCP/IP Principles, Protocols, And Architecture",Pearson Education
    3. KavehPahlavan, Prashant Krishnamurthy, “Networking Fundamentals”, Wiley Publication.
    4. Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, “Computer Networks: An Open Source Approach”, McGraw Hill.