{"version":"1.0","provider_name":"Glosarix","provider_url":"https:\/\/glosarix.com\/en\/","author_name":"Team Glosarix","author_url":"https:\/\/glosarix.com\/en\/author\/adm_glosarix\/","title":"Nondeterministic Finite Automaton - Glosarix","type":"rich","width":600,"height":338,"html":"<blockquote class=\"wp-embedded-content\" data-secret=\"PIZhhUGD7H\"><a href=\"https:\/\/glosarix.com\/en\/glossary\/nondeterministic-finite-automaton-en\/\">Nondeterministic Finite Automaton<\/a><\/blockquote><iframe sandbox=\"allow-scripts\" security=\"restricted\" src=\"https:\/\/glosarix.com\/en\/glossary\/nondeterministic-finite-automaton-en\/embed\/#?secret=PIZhhUGD7H\" width=\"600\" height=\"338\" title=\"&#8220;Nondeterministic Finite Automaton&#8221; &#8212; Glosarix\" data-secret=\"PIZhhUGD7H\" frameborder=\"0\" marginwidth=\"0\" marginheight=\"0\" scrolling=\"no\" class=\"wp-embedded-content\"><\/iframe><script>\n\/*! This file is auto-generated *\/\n!function(d,l){\"use strict\";l.querySelector&&d.addEventListener&&\"undefined\"!=typeof URL&&(d.wp=d.wp||{},d.wp.receiveEmbedMessage||(d.wp.receiveEmbedMessage=function(e){var t=e.data;if((t||t.secret||t.message||t.value)&&!\/[^a-zA-Z0-9]\/.test(t.secret)){for(var s,r,n,a=l.querySelectorAll('iframe[data-secret=\"'+t.secret+'\"]'),o=l.querySelectorAll('blockquote[data-secret=\"'+t.secret+'\"]'),c=new RegExp(\"^https?:$\",\"i\"),i=0;i<o.length;i++)o[i].style.display=\"none\";for(i=0;i<a.length;i++)s=a[i],e.source===s.contentWindow&&(s.removeAttribute(\"style\"),\"height\"===t.message?(1e3<(r=parseInt(t.value,10))?r=1e3:~~r<200&&(r=200),s.height=r):\"link\"===t.message&&(r=new URL(s.getAttribute(\"src\")),n=new URL(t.value),c.test(n.protocol))&&n.host===r.host&&l.activeElement===s&&(d.top.location.href=t.value))}},d.addEventListener(\"message\",d.wp.receiveEmbedMessage,!1),l.addEventListener(\"DOMContentLoaded\",function(){for(var e,t,s=l.querySelectorAll(\"iframe.wp-embedded-content\"),r=0;r<s.length;r++)(t=(e=s[r]).getAttribute(\"data-secret\"))||(t=Math.random().toString(36).substring(2,12),e.src+=\"#?secret=\"+t,e.setAttribute(\"data-secret\",t)),e.contentWindow.postMessage({message:\"ready\",secret:t},\"*\")},!1)))}(window,document);\n\/\/# sourceURL=https:\/\/glosarix.com\/wp-includes\/js\/wp-embed.min.js\n<\/script>\n","description":"Description: A Non-Deterministic Finite Automaton (NFA) is a computational model used to represent and manipulate formal languages. Unlike its deterministic counterpart, the NFA allows the same state to transition to multiple states in response to the same input symbol, providing greater flexibility in pattern representation. This type of automaton consists of a finite set of [&hellip;]"}