Theory Of Computation | Types of Automata and Representation

-

The validation of a string for its membership in a language are handled by automata.

An automaton acts as a acceptor of a string for a given language

This is an example for an automaton which accepts all strings containing at least one 'a'.

These circles are known as states. So X and Y are states.

Circle with dual boundary (here Y) is final state and one with unmarked arrow is initial state(here X).

Consider the string "baba",

Initially we are at X, on seeing first alphabet 'b' the automaton loop back to X itself( Edge with alphabet 'b' point to X itself).

On seeing next alphabet 'a', the state transition happens and reaches at new state Y.

Once we reaches at state Y, both 'a' and 'b' loop back to the same state.

So the string "baba" finally reaches as state Y

Since the Y is the final state of this automaton, we can conclude that the sting "baba" belongs to the language represented by the given automaton.

All finite automata are classified as follows :

  1. Automata with output
    • Moore Machine
    • Mealy Machine
  2. Automata without output
    • Deterministic Finite Automata (DFA)
    • Non-deterministic Finite Automata (NFA)
    • Epsilon NFA (ε-NFA)

We will discuss about each of of them in detail in upcoming posts.

Comments

Post a Comment

Popular posts from this blog

Theory of Computation | Symbols, Alphabets, Strings and Language

-
Theory of computation or Automata theory mainly deals with abstract modeling of machines and computation. These models embody some of the important complex logical features we encounter, on dealing software as hardware. The following are the basic terminologies, which are frequently used in Theory of Computation Symbol The smallest building entity of Automata Theory( or Theory of Computation) is known as symbol. example: a, 2, i, B... Alphabet A set of symbols forms an alphabet. An alphabet is usually represented by Greek letter sigma( Σ ) example: Σ= { x, y} String A string is a sequence of symbols in a alphabet. example: 'xy' is a string derived from the alphabet Σ= { x, y} Language Collection of strings are called as a language. example: Let an alphabet Σ= { p, q, r} Then if a language L of set of a strings of length 2 over Σ can be represented as L = { pp, pq, pr, qp, qq, qr, rp, rq, rr } ...
Next »

Operating Systems | Types and Functions

-
Image
An operating system is an interface between user and hardware of a system and it controls allocation of resources and its retrieval. The major functions of operating systems are Dynamic handling of available/allocated/free spaces of memory. Controlling of process state transitions efficiently. Maintaining of consistency in resource access by different processes synchronization methods. incorporation of protection and security in the system. The main objectives of an operating systems to, to provide convenient interface to its users and it should be efficient to process complex scientific data. The fundamental operations of an OS can be described as follows: Synchronization of processes What ever you do on your system is a process. Let us say your sending a request to your printer from a word document when your printe...
Next »

Computer Network | Flow control Methods: Stop and Wait

-
Image
Some times sending data packets at higher rate to a less efficient receiver may cause for the discarding of data from the buffer and lead to data loss. Flow control methods are used to avoid this dilemma. Stop and Wait When the data packet from the sender reaches at the receiver it returns a success message and once the sender acknowledges the success return it will go for the the next one. This sequence of protocols are know as stop and wait method of flow control. In theoretical questions T q and T process usually approximates as zero. Generally Transmission delay for the acknowledgement will be negligibly small (about 10 -3 times) compared to transmission delay for the data,which may also can approximate to zero. Piggybacking is a concept where data is send along with acknowledgment and other control information during bidirectional communication. So in Piggybacking acknowledgement time will become equal to that of propagation transmission time. Cases where T ac...
Next »