[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"detail-sidebar-cat-0-en-105":3,"doc-seo-665511-105":59,"doc-detail-665511-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","aqa-computer-science-as-level-342-finite-state-machines-fsms-intermediate-notes-3-study-guide","AQA Computer Science AS Level 3.4.2 Finite state machines (FSMs) - Intermediate Notes - 3 - study guide","","Intermediate notes for AQA Computer Science AS Level topic 3.4.2.1 on finite state machines without output, focusing on drawing and interpreting simple state transition diagrams and transition tables. Defines FSMs as machines in a fixed current state, changing via transition rules, with valid input leading to an accepting state. Includes diagram features (states as circles, accepting state as double circle) and explains acceptance of inputs starting with “11”. Provides a transition table example and a practical parking machine scenario using 10p and 20p coins.",{"@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/aqa-computer-science-as-level-342-finite-state-machines-fsms-intermediate-notes-3-study-guide/665511/",{"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/aqa-computer-science-as-level-342-finite-state-machines-fsms-intermediate-notes-3-study-guide/665511.png","ImageObject",300,407,{"name":92,"@type":93},"awa","Person",{"url":74,"name":95,"@type":96},"DocShare","Organization","application/pdf","2026-10-30","2026-10-29",true,{"@type":102,"interactionType":103,"userInteractionCount":8},"InteractionCounter",{"@type":104},"ViewAction",{"@type":106,"mainEntity":107},"FAQPage",[108,114,118],{"name":109,"@type":110,"acceptedAnswer":111},"What is a finite state machine (FSM) and how does it change state?","Question",{"text":112,"@type":113},"An FSM is a model that is always in one fixed state at a time. Its state changes according to transition rules based on the current state and the input.","Answer",{"name":115,"@type":110,"acceptedAnswer":116},"What does it mean for an FSM to have an accepting state?",{"text":117,"@type":113},"With valid input, the FSM terminates in what is known as an accepting state. The accepting state is shown as a double circle in state transition diagrams.",{"name":119,"@type":110,"acceptedAnswer":120},"How do you represent transitions using a state transition table?",{"text":121,"@type":113},"A state transition table records the transition function using columns for the current state, the input, and the next state. Each row specifies what state the FSM moves to for a given input.","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},665511,1793304607,{"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":8,"is_deleted":4,"is_public":8,"is_downloadable":8,"audit_status":8,"page_count":19,"language":139,"language_code":63,"site_id":62,"html_lang":63,"table_of_contents":140,"faqs":141,"seo_title":142,"seo_description":67,"update_tm":129,"read_time":52},3985747858093,"https://ap-avatar.wpscdn.com/davatar_3d24733baf745e90a7e4bdd5f77d97b2","AQA Computer Science AS Level 3.4.2 Finite state machines (FSMs)  \nIntermediate Notes  \nSpecification:  \n3.4.2.1 Finite state machines (FSMs) without output:  \nBe able to draw and interpret simple state transition diagrams and state transition tables for FSMs with no output.  \nFinite State Machines  \nA finite state machine (or FSM for short) is a model for a machine that is always in a fixed state. Each finite state machine has a set number of states and can only ever be in one state at once.  \nData can be input to a finite state machine and if the input data is valid, the finite state machine will terminate in what’s known as an accepting state.  \nA finite state machine’s state can change and does so according to transition rules , rules that describe what a finite state machine should do given certain criteria.  \nState Transition Diagrams  \nState transition diagrams are used by computer scientists as a visual representation of a finite state machine. They consist of states (circles) joined by transitions (arrows) and an accepting state , shown as a double circle.  \nFor example, the state transition diagram above has four states: S0 , S 1 , S2 and S3. S3 is an accepting state.  \nThe transition functions are each represented by an arrow from one state to another.  \nThe finite state machine represented by the state transition diagram will only accept input data that starts with 11. For example: 11 , 110 , 11101 and 11001100.  \nState Transition Tables  \nThe transition function between S0 and S 1 in the previous diagram could be described in English as “If the finite state machine is in state S0 and the input is 1, move to state S 1.”  \nThe transition functions in a finite state machine can be notated more formally using a state transition table , with columns for current state, input and next state, like the one below.  \n\n| Current State | Input | Next State |\n| --- | --- | --- |\n| S0 | 1 | S1 |\n| S0 | 0 | S2 |\n| S1 | 1 | S3 |\n| S1 | 0 | S2 |\n\nExample-Parking Machine  \nThe finite state machine shown by the state transition diagram below represents a parking machine which requires 50p to be payed. The machine is only designed to take coins worth 10p or more.  \nIf the customer first pays 10p, the machine moves into the 10p state, from which the customer can input another 10p or 20p. The 50p state is the accepting state.","cbCaif2aXRq3NyPz","https://ap.wps.com/l/cbCaif2aXRq3NyPz","pdf",138304,"English","# Finite state machines (FSMs)\n## FSMs without output: learning objectives\n## State transition diagrams\n## State transition tables\n## Example: parking machine","[{\"question\":\"What is a finite state machine (FSM) and how does it change state?\",\"answer\":\"An FSM is a model that is always in one fixed state at a time. Its state changes according to transition rules based on the current state and the input.\"},{\"question\":\"What does it mean for an FSM to have an accepting state?\",\"answer\":\"With valid input, the FSM terminates in what is known as an accepting state. The accepting state is shown as a double circle in state transition diagrams.\"},{\"question\":\"How do you represent transitions using a state transition table?\",\"answer\":\"A state transition table records the transition function using columns for the current state, the input, and the next state. Each row specifies what state the FSM moves to for a given input.\"}]","AQA Computer Science AS Level 3.4.2 Finite state machines (FSMs) - Intermediate Notes - 3 - study guide | PDF"]