LEADER 05589nam 22008175 450 001 9910349426003321 005 20251225202212.0 010 $a9783319773131 010 $a3319773135 024 7 $a10.1007/978-3-319-77313-1 035 $a(CKB)4100000002892497 035 $a(DE-He213)978-3-319-77313-1 035 $a(MiAaPQ)EBC6305190 035 $a(MiAaPQ)EBC5578092 035 $a(Au-PeEL)EBL5578092 035 $a(OCoLC)1033645029 035 $a(PPN)226696367 035 $a(EXLCZ)994100000002892497 100 $a20180307d2018 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aLanguage and Automata Theory and Applications $e12th International Conference, LATA 2018, Ramat Gan, Israel, April 9-11, 2018, Proceedings /$fedited by Shmuel Tomi Klein, Carlos Martín-Vide, Dana Shapira 205 $a1st ed. 2018. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2018. 215 $a1 online resource (X, 321 p. 39 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10792 311 08$a9783319773124 311 08$a3319773127 327 $aUnderlying principles and recurring ideas of formal grammars -- Sliding Window Algorithms for Regular Languages -- Reshaping the context-free model: linguistic and algorithmic aspects -- Disturbance Decoupling in Finite Automata -- On the synchronization of planar automata -- Event-Clock Nested Automata -- On Periodicity Lemma for Partial Words -- Bubble-Flip - A New Generation Algorithm for Prefix Normal Words -- Pomsets and Unfolding of Reset Petri Nets -- Over-Approximative Petri Net Synthesis for Restricted Subclasses of Nets -- Measuring Closeness between Cayley Automatic Groups and Automatic Groups -- Permutations sorted by a finite and an infinite stack in series -- Analytic combinatorics of lattice paths with forbidden patterns: enumerative aspects -- Deciding regular intersection emptiness of complete problems for PSPACE and the polynomial hierarchy -- Descriptional and computational complexity of the circuit representation of finite automata -- Model Learning as a Satisfiability Modulo Theories Problem -- Default Logic and Bounded Treewidth -- General Class of Monoids Supporting Canonisation and Minimisation of (Sub)sequential Transducers -- Learners Based on Transducers -- Handling ties correctly and efficiently in Viterbi training using the Viterbi semiring -- Formal languages over GF(2) -- Timed Comparisons of Semi-Markov Processes -- Efficient Translation with Linear Bimorphisms. 330 $aThis book constitutes the refereed proceedings of the 12th International Conference on Language and Automata Theory and Applications, LATA 2018, held in Ramat Gan, Israel, in April 2018. The 20 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 58 submissions. The papers cover fields like algebraic language theory, algorithms for semi-structured data mining, algorithms on automata and words, automata and logic, automata for system analysis and programme verification, automata networks, automatic structures, codes, combinatorics on words, computational complexity, concurrency and Petri nets, data and image compression, descriptional complexity, foundations of finite state technology, foundations of XML, grammars (Chomsky hierarchy, contextual, unification, categorial, etc.), grammatical inference and algorithmic learning, graphs and graph transformation, language varieties and semigroups, language-based cryptography, mathematical and logical foundations of programming methodologies, parallel and regulated rewriting, parsing, patterns, power series, string processing algorithms, symbolic dynamics, term rewriting, transducers, trees, tree languages and tree automata, and weighted automata. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10792 606 $aComputer science 606 $aMachine theory 606 $aAlgorithms 606 $aComputer programming 606 $aArtificial intelligence 606 $aComputer science$xMathematics 606 $aMathematical statistics 606 $aComputer Science Logic and Foundations of Programming 606 $aFormal Languages and Automata Theory 606 $aAlgorithms 606 $aProgramming Techniques 606 $aArtificial Intelligence 606 $aProbability and Statistics in Computer Science 615 0$aComputer science. 615 0$aMachine theory. 615 0$aAlgorithms. 615 0$aComputer programming. 615 0$aArtificial intelligence. 615 0$aComputer science$xMathematics. 615 0$aMathematical statistics. 615 14$aComputer Science Logic and Foundations of Programming. 615 24$aFormal Languages and Automata Theory. 615 24$aAlgorithms. 615 24$aProgramming Techniques. 615 24$aArtificial Intelligence. 615 24$aProbability and Statistics in Computer Science. 676 $a511.3 702 $aKlein$b Shmuel Tomi$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMartín-Vide$b Carlos$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aShapira$b Dana$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910349426003321 996 $aLanguage and Automata Theory and Applications$9774044 997 $aUNINA