[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"detail-sidebar-cat-0-en-105":3,"doc-seo-394150-105":59,"doc-detail-394150-en":130},{"code":4,"msg":5,"data":6},0,"success",[7,13,18,23,28,33,38,43,48,51,55],{"id":8,"doc_module":4,"doc_module_name":9,"category_name":10,"show_sort_weight":11,"slug":12},1,"Document","Story & Novel",90,"story-novel",{"id":14,"doc_module":4,"doc_module_name":9,"category_name":15,"show_sort_weight":16,"slug":17},2,"Literature",80,"literature",{"id":19,"doc_module":4,"doc_module_name":9,"category_name":20,"show_sort_weight":21,"slug":22},4,"Exam",70,"exam",{"id":24,"doc_module":4,"doc_module_name":9,"category_name":25,"show_sort_weight":26,"slug":27},5,"Comic",60,"comic",{"id":29,"doc_module":4,"doc_module_name":9,"category_name":30,"show_sort_weight":31,"slug":32},6,"Technology",50,"technology",{"id":34,"doc_module":4,"doc_module_name":9,"category_name":35,"show_sort_weight":36,"slug":37},7,"Healthcare",40,"healthcare",{"id":39,"doc_module":4,"doc_module_name":9,"category_name":40,"show_sort_weight":41,"slug":42},8,"Research & Report",30,"research-report",{"id":44,"doc_module":4,"doc_module_name":9,"category_name":45,"show_sort_weight":46,"slug":47},9,"Religion & Spirituality",20,"religion-spirituality",{"id":46,"doc_module":4,"doc_module_name":9,"category_name":49,"show_sort_weight":46,"slug":50},"World Cup","world-cup",{"id":52,"doc_module":4,"doc_module_name":9,"category_name":53,"show_sort_weight":52,"slug":54},10,"Lifestyle","lifestyle",{"id":56,"doc_module":4,"doc_module_name":9,"category_name":57,"show_sort_weight":24,"slug":58},19,"General","general",{"code":4,"msg":60,"data":61},"ok",{"site_id":62,"language":63,"slug":64,"title":65,"keywords":66,"description":67,"schema_data":68,"social_meta":123,"head_meta":125,"extra_data":127,"updated_unix":129},105,"en","finite-automata-chapter-1","FINITE AUTOMATA - Chapter 1","","The document introduces the theory of computation by starting from a practical question—what a computer is—and motivates the use of idealized computational models. It then develops finite automata (finite-state machines) as a model with extremely limited memory, illustrating how such systems represent control logic. Using examples like an automatic door controller, it explains states, inputs, state diagrams, and transition tables, before moving toward formal mathematical definitions, terminology, and the limits of power.",{"@graph":69,"@context":122},[70,84,105],{"@type":71,"itemListElement":72},"BreadcrumbList",[73,77,79,82],{"item":74,"name":75,"@type":76,"position":8},"https://docshare.wps.com","Home","ListItem",{"item":78,"name":9,"@type":76,"position":14},"https://docshare.wps.com/document/",{"item":80,"name":20,"@type":76,"position":81},"https://docshare.wps.com/document/exam/",3,{"item":83,"name":65,"@type":76,"position":19},"https://docshare.wps.com/document/finite-automata-chapter-1/394150/",{"url":83,"name":65,"@type":85,"image":86,"author":91,"headline":65,"publisher":94,"fileFormat":97,"inLanguage":63,"description":67,"dateModified":98,"datePublished":99,"encodingFormat":97,"isAccessibleForFree":100,"interactionStatistic":101},"DigitalDocument",{"url":87,"@type":88,"width":89,"height":90},"https://docshare.wps.com/thumbnails/finite-automata-chapter-1/394150.png","ImageObject",300,407,{"name":92,"@type":93},"Maya Linwood","Person",{"url":74,"name":95,"@type":96},"DocShare","Organization","application/pdf","2026-11-06","2026-09-26",true,{"@type":102,"interactionType":103,"userInteractionCount":39},"InteractionCounter",{"@type":104},"ViewAction",{"@type":106,"mainEntity":107},"FAQPage",[108,114,118],{"name":109,"@type":110,"acceptedAnswer":111},"Why are finite automata useful models for certain computers?","Question",{"text":112,"@type":113},"Finite automata are effective for computers with extremely limited memory, capturing behavior with a small number of states.","Answer",{"name":115,"@type":110,"acceptedAnswer":116},"How does the automatic door controller model its behavior?",{"text":117,"@type":113},"The controller uses two states, OPEN and CLOSED, and changes state based on inputs FRONT, REAR, BOTH, or NEITHER, which represent where a person is detected.",{"name":119,"@type":110,"acceptedAnswer":120},"What is the next step after the intuitive examples of finite automata?",{"text":121,"@type":113},"The document shifts to a mathematical perspective, aiming to define finite automata precisely, introduce terminology, and present theoretical results about their power and limitations.","https://schema.org",{"og:url":83,"og:type":124,"og:title":65,"og:site_name":95,"og:description":67},"article",{"robots":126,"canonical":83},"index,follow",{"doc_id":128,"site_id":62},394150,1790944978,{"code":4,"msg":5,"data":131},{"doc_id":128,"user_id":132,"nickname":92,"user_avatar":133,"doc_module":4,"category_id":19,"category_name":20,"doc_title":65,"doc_description":67,"doc_content":134,"file_id":135,"file_url":136,"file_type":137,"file_size":138,"view_count":39,"is_deleted":4,"is_public":8,"is_downloadable":8,"audit_status":8,"page_count":139,"language":140,"language_code":63,"site_id":62,"html_lang":63,"table_of_contents":141,"faqs":142,"seo_title":143,"seo_description":67,"update_tm":144,"read_time":145,"preview_page_count":4},962084928432,"https://ap-avatar.wpscdn.com/davatar_155a257f0dc6eb9ab79c44ca47cae57d","REGULA R LAN GUA GE S  \nThe theory of computation begins with a question:What is a computer?It isperhaps a silly question,as everyone knows that this thing I type on is a com-puter.But these real computers are quite complicated—too much so to allow usto set up a manageable mathematical theory of them directly.Instead we use anidealized computer called a computational model.As with any model in science,a computational model may be accurate in some ways but perhaps not in others.Thus we will use several different computational models,depending on the fea-tures we want to focus on.We begin with the simplest model,called the finitestate machine or finite automaton.  \n1.1  \n啪    预 作    衡 指 语 做 当t:案 留 势 望    恐       影          当 隧     ”    得 当  \n# FINITE AUTOMATA\n\nFinite automata are good models for computers with an extremely limitedamount of memory.What can a computer do with such a small memory?Manyuseful things!In fact,we interact with such computers all the time,as they lie atthe heart of various electromechanical devices.  \nThe controller for an automatic door is one example of such a device.Oftenfound at supermarket entrances and exits,automatic doors swing open whensensing that a person is approaching.An automatic door has a pad in front to  \ndetect the presence of a person about to walk through the doorway.Anotherpad is located to the rear of the doorway so that the controller can hold the dooropen long enough for the person to pass all the way through and also so that thedoor does not strike someone standing behind it as it opens.This configurationis shown in the following figure.  \ndoor  \nFIGURE 1.1  \nTop view of an automatic door  \nThe controller is in either of two states:“OPEN”or“CLOSED,”representingthe corresponding condition of the door.As shown in the following figures,there are four possible input conditions:“FRONT”(meaning that a person isstanding on the pad in front of the doorway),“REAR”(meaning that a person isstanding on the pad to the rear of the doorway),“BOTH”(meaning that peopleare standing on both pads),and “NEITHER”(meaning that no one is standingon either pad).  \nFIGURE 1.2  \nState diagram for automatic door controller  \n1.1 FINITE AUTOMATA 33  \ninput signal  \n\n|  | NEITHER    | FRONT   | REAR   | BOTH   |\n| --- | --- | --- | --- | --- |\n| CLOSED   | CLOSED   | OPEN   | CLOSED    | CLOSED   |\n| OPEN   | CLOSED   | OPEN   | OPEN   | OPEN   |\n\nstate  \nFIGURE 1.3  \nState transition table for automatic door controller  \nThe controller moves from state to state,depending on the input it receives.When in the CLOSED state and receiving input NEITHER or REAR,it remainsin the CLOSED state.In addition,if the input BOTH is received,it stays CLOSEDbecause opening the door risks knocking someone over on the rear pad.But ifthe input FRONT arrives,it moves to the OPEN state.In the OPEN state,if inputFRONT,REAR,or BOTH is received,it remains in OPEN.If input NEITHERarrives,it returns to CLOSED.  \nFor example,a controller might start in state CLOSED and receive the seriesof input signals FRONT,REAR,NEITHER,FRONT,BOTH,NEITHER,REAR,and NEITHER.It then would go through the series of states CLOSED(starting),OPEN,OPEN,CLOSED,OPEN,OPEN,CLOSED,CLOSED,and CLOSED.  \nThinking of an automatic door controller as a finite automaton is useful be-cause that suggests standard ways of representation as in Figures 1.2 and 1.3.This controller is a computer that has just a single bit of memory,capable ofrecording which of the two states the controller is in.Other common deviceshave controllers with somewhat larger memories.In an elevator controller astate may represent the floor the elevator is on and the inputs might be the sig-nals received from the buttons.This computer might need several bits to keeptrack of this information.Controllers for various household appliances such asdishwashers and electronic thermostats,as well as parts of digital watches andcalculators,are additional examples of computers with limited memories.Thedesign of ","cbCaifMI1M0hulsp","https://ap.wps.com/l/cbCaifMI1M0hulsp","pdf",5110946,68,"English","# FINITE AUTOMATA\n## 1.1 Finite Automata\n## Automatic Door Controller as an Automaton\n## State Diagram and Transition Table\n## Formal Mathematical Perspective: Definition and Terminology","[{\"question\":\"Why are finite automata useful models for certain computers?\",\"answer\":\"Finite automata are effective for computers with extremely limited memory, capturing behavior with a small number of states.\"},{\"question\":\"How does the automatic door controller model its behavior?\",\"answer\":\"The controller uses two states, OPEN and CLOSED, and changes state based on inputs FRONT, REAR, BOTH, or NEITHER, which represent where a person is detected.\"},{\"question\":\"What is the next step after the intuitive examples of finite automata?\",\"answer\":\"The document shifts to a mathematical perspective, aiming to define finite automata precisely, introduce terminology, and present theoretical results about their power and limitations.\"}]","FINITE AUTOMATA - Chapter 1 | PDF",1790399265,171]