{"product_id":"implementation-and-application-of-automata-9783032026019","title":"Implementation and Application of Automata","description":"\u003cb\u003eBook Synopsis\u003c\/b\u003e\u003cbr\u003e\u003cp\u003e.- Complementable Normal Form of Parametrized Automata.\u003c\/p\u003e\u003cp\u003e.- Toward the Glushkovization of Automata: the Strong Stabilization.\u003c\/p\u003e\u003cp\u003e.- Constructing Compact BPE Token DFAs.\u003c\/p\u003e\u003cp\u003e.- Epsilon Automata on Linear Orderings.\u003c\/p\u003e\u003cp\u003e.- Multi-entry DFA with reduced initial states to speedup parallel recognition.\u003c\/p\u003e\u003cp\u003e.- Two-Way Automata and Bounded Languages.\u003c\/p\u003e\u003cp\u003e.- An Algebraic Approach to the Equivalence Checking of Deterministic Top-down Tree Transducers.\u003c\/p\u003e\u003cp\u003e.- An active learning algorithm for bidirectional deterministic finite automata.\u003c\/p\u003e\u003cp\u003e.- Dynamically Weighted Tree Transducers.\u003c\/p\u003e\u003cp\u003e.- Engineering an LTLf Synthesis Tool.\u003c\/p\u003e\u003cp\u003e.- Subsequence Matching and Analysis Problems for Automata with Translucent Letters.\u003c\/p\u003e\u003cp\u003e.- Shape Preserving Tree Transducers.\u003c\/p\u003e\u003cp\u003e.- Simulating two-way nondeterministic finite automata over small alphabets by one-way nondeterministic automata.\u003c\/p\u003e\u003cp\u003e.- A New Approach for Showing Termination of Parameterized Transition Systems.\u003c\/p\u003e\u003cp\u003e.- An Earley-Based Universal Error-Correcting Parser.\u003c\/p\u003e\u003cp\u003e.- More on Language Families with a Decidable Pumping-Problem (Extended Abstract).\u003c\/p\u003e\u003cp\u003e.- Self-Verifying Predicates in B¨uchi Arithmetic.\u003c\/p\u003e\u003cp\u003e.- State-Freezing Pushdown Automata.\u003c\/p\u003e\u003cp\u003e.- From regular expressions to deterministic finite automata: $2ˆ{frac{n}{2}+sqrt{n}(log n)ˆ{Theta(1)}}$ states are necessary and sufficient.\u003c\/p\u003e\u003cp\u003e.- A first taste of MeSCaL, a tool for solving membership problems for regular languages.\u003c\/p\u003e\u003cp\u003e.- In orbit with MeSCaL: higher in concatenation and navigational hierarchies of regular languages.\u003c\/p\u003e\u003cp\u003e.- A hierarchy of reversible finite automata.\u003c\/p\u003e","brand":"Springer","offers":[{"title":"Default Title","offer_id":53195515363671,"sku":"9783032026019","price":59.99,"currency_code":"GBP","in_stock":true}],"url":"https:\/\/bookcurl.com\/products\/implementation-and-application-of-automata-9783032026019","provider":"Book Curl","version":"1.0","type":"link"}