{"id":6527,"date":"2026-03-12T11:19:40","date_gmt":"2026-03-12T05:49:40","guid":{"rendered":"https:\/\/study.madeeasy.in\/?p=6527"},"modified":"2026-03-30T16:18:32","modified_gmt":"2026-03-30T10:48:32","slug":"finite-automata","status":"publish","type":"post","link":"https:\/\/www.madeeasy.in\/study\/cs-it\/finite-automata","title":{"rendered":"Finite Automata"},"content":{"rendered":"<h2 style=\"text-align: justify;\">What is Finite Automata?<\/h2>\n<ul style=\"text-align: justify;\">\n<li>Finite Automaton (FA) is also called as Finite State machine (FSM).<\/li>\n<li>Finite Automaton has no temporary storage hence it can remember finite information with the help of finite control which contain states and transitions.<\/li>\n<\/ul>\n<h2 style=\"text-align: justify;\"><strong>Types of Finite Automata<\/strong><\/h2>\n<p style=\"text-align: justify;\"><strong>Finite automata is categorized into two types:<\/strong><\/p>\n<p style=\"text-align: justify;\"><strong>1. Finite automata with output:<\/strong> This is of two types Mealy machines and Moore machines.<\/p>\n<p style=\"text-align: justify;\">(a) In a Mealy machine the output is associated with transition (state and input symbol).<br \/>\n(b) In the Moore machine, output is associated with only state.<\/p>\n<p style=\"text-align: justify;\"><strong>2. Finite automata without output:<\/strong> This is of two types, deterministic and non-deterministic.<\/p>\n<p style=\"text-align: justify;\"><strong>(a) Deterministic Finite Automata (DFA):<\/strong> It is deterministic finite automata. For every input symbol in DFA there is an exactly one transition from any state of finite automata.<\/p>\n<p style=\"text-align: justify;\">It accepts the string by halting at a final state and rejects the string by halting at a non-final state.<br \/>\n<strong>(b) Non-deterministic Finite Automata (NFA):<\/strong> It is non-deterministic finite automata. For every input symbol in NFA there is zero or more transitions from any state of finite automata.<\/p>\n<p style=\"text-align: justify;\">It accepts the string by halting at a final state and rejects the string either by halting at a non-final state or by halting in a dead configuration.<br \/>\n<strong>(c) \u03b5-NFA:<\/strong> It is a nondeterministic finite automaton that can include \u03b5 transitions. It has the capability of changing the state without reading the input symbol.<\/p>\n<h3 style=\"text-align: justify;\">Representations of FA<\/h3>\n<p style=\"text-align: center;\">FA = (Q, \u03a3, \u03b4, q0, F) is a 5-tuple notation<\/p>\n<p style=\"text-align: center;\">where, Q is set of finite states,<\/p>\n<p style=\"text-align: justify;\">\u03a3 is an input alphabet containing a finite number of input symbols.<br \/>\n\u03b4 is a transition function defined over transitions of FA for state and input.<br \/>\nq0 is the initial state or start state of FA, q0 \u2208 Q.<br \/>\nF is the set of final states of FA.<\/p>\n<p style=\"text-align: center;\"><a class=\"btn btn-danger\" role=\"button\" href=\"https:\/\/study.madeeasy.in\/cs-it\/turing-machine\" target=\"_blank\" rel=\"noopener\">&lt;&lt; Previous<\/a> | <a class=\"btn btn-success\" role=\"button\" href=\"https:\/\/study.madeeasy.in\/cs-it\/deterministic-finite-automata-dfa\" target=\"_blank\" rel=\"noopener\"> Next &gt;&gt;<\/a><br \/>\n<strong> Must Read: <\/strong> <a href=\"https:\/\/study.madeeasy.in\/cs-it\/what-is-theory-of-computation\" target=\"_blank\" rel=\"noopener\"><strong>What is Theory of Computation?<\/strong><\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>What is Finite Automata? Finite Automaton (FA) is also called as Finite State machine (FSM). Finite Automaton has no temporary<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3,1930],"tags":[1932,1933,1931,1934],"class_list":["post-6527","post","type-post","status-publish","format-standard","hentry","category-cs-it","category-computation","tag-finite-automata-with-output","tag-finite-automata-without-output","tag-representations-of-fa","tag--nfa"],"_links":{"self":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/posts\/6527","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/comments?post=6527"}],"version-history":[{"count":0,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/posts\/6527\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/media?parent=6527"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/categories?post=6527"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/tags?post=6527"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}