{"product_id":"descriptional-complexity-of-formal-systems-cezar-campeanu-ebook","title":"Descriptional Complexity of Formal Systems","description":"\u003cp\u003e.- Invited Talks.\u003c\/p\u003e\n\u003cp\u003e.- The Power and Limits of Population Protocols.\u003cbr\u003e.- Formal Language Theory and Transformers.\u003cbr\u003e.- Representing Concepts with Small Teaching Sets.\u003c\/p\u003e\n\u003cp\u003e.- Contributed Papers.\u003c\/p\u003e\n\u003cp\u003e.- 2-word-π-representable Graphs.\u003cbr\u003e.- Largest Finite Optimal Existential and Universal Widths of unary AFAs.\u003cbr\u003e.- On the Average State Complexity of Shuffle Ideals.\u003cbr\u003e.- Quantifying Distance From Simplicity.\u003cbr\u003e.- Some Descriptional Complexity Results for Context-Conditional Grammars.\u003cbr\u003e.- Exact Accepting-State Spectrum for Reversal of Permutation Automata.\u003cbr\u003e.- A Unary-to-Nonunary Transition in the Accepting-State Spectrum of Right Quotient for Permutation Automata.\u003cbr\u003e.- The Boundary of Closed and Ideal Languages.\u003cbr\u003e.- State-Limited Inductive Inference of Cellular Automata.\u003cbr\u003e.- Bounds on the number of θ-palindromes in θ-conjugates.\u003cbr\u003e.- State Complexity of Shifts of the Fibonacci Word.\u003cbr\u003e.- On the Complexity of Multi-entry DFAs.\u003cbr\u003e.- Determinizing k-path input-driven PDAs.\u003c\/p\u003e","brand":"Cezar Câmpeanu","offers":[{"title":"Default Title","offer_id":54386829459783,"sku":"9783032320162","price":60.98,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0920\/5455\/2903\/files\/descriptional-complexity-of-formal-systems-ebook-cover.webp?v=1784498465","url":"https:\/\/www.cinebuch.de\/products\/descriptional-complexity-of-formal-systems-cezar-campeanu-ebook","provider":"CineBuch","version":"1.0","type":"link"}