LEADER 04555nam 22005895 450 001 9910878067403321 005 20240905171719.0 010 $a9783031661594$b(electronic bk.) 010 $z9783031661587 024 7 $a10.1007/978-3-031-66159-4 035 $a(MiAaPQ)EBC31569912 035 $a(Au-PeEL)EBL31569912 035 $a(CKB)33468923000041 035 $a(DE-He213)978-3-031-66159-4 035 $a(EXLCZ)9933468923000041 100 $a20240726d2024 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aDevelopments in Language Theory $e28th International Conference, DLT 2024, Göttingen, Germany, August 12?16, 2024, Proceedings /$fedited by Joel D. Day, Florin Manea 205 $a1st ed. 2024. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2024. 215 $a1 online resource (310 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v14791 311 08$aPrint version: Day, Joel D. Developments in Language Theory Cham : Springer,c2024 9783031661587 320 $aIncludes bibliographical references and index. 327 $a -- Word equations, constraints and formal languages. -- Algorithms and combinatorics on two-dimensional strings. -- Polyregular Functions ? Characterisations and Refutations. -- Cellular Automata: From Black-and-White to High Gloss Color. -- Deciding Conjugacy of a Rational Relation. -- Logic and Languages of Higher-Dimensional Automata. -- Universal Rewriting Rules for the Parikh Matrix Injectivity Problem. -- $O_2$ is a multiple context-free grammar: an implementation-, formalisation-friendly proof. -- Cyclic Operator Precedence Grammars for Improved Parallel Parsing. -- On the complexity and approximability of Bounded access Lempel Ziv coding. -- How to Find Long Maximal Exact Matches and Ignore Short Ones. -- The Pumping Lemma for Context-Free Languages is Undecidable . -- Techniques for Showing the Decidability of the Boundedness Problem of Language Acceptors. -- Semidirect Product Decompositions for Periodic Regular Languages. -- Approximate Cartesian Tree Pattern Matching. -- Deterministic Pushdown Automata with Translucent Input Letters. -- Network Topologies for Parallel Communicating Finite Automata: Token-Ring and Token-Bus. -- Finite Automata with Sets of Translucent Words. -- Careful Synchronization of One-Cluster Automata. -- Verifying And Interpreting Neural Networks using Finite Automata. -- Around Don?s conjecture for binary completely reachable automata. 330 $aThis book constitutes the refereed proceedings of the 28th International Conference on Developments in Language Theory, DLT 2024, held in Göttingen, Germany, during August 12?16, 2024. The 17 full papers and 4 invited papers included in this book were carefully reviewed and selected from 26 submissions. They presented current developments in formal languages and automata. The scope is very general and includes, among others, the following topics and areas: grammars, acceptors and transducers for words; trees and graphs; relations between formal languages and artificial neural networks; algebraic theories of automata; algorithmic, combinatorial, and algebraic properties of words and languages; variable length codes; symbolic dynamics; cellular automata; groups and semigroups generated by automata; polyominoes and multidimensional patterns; decidability questions; image manipulation and compression; efficient text algorithms; relationships to cryptography, concurrency, complexity theory, and logic; bio-inspired computing; and quantum computing. . 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v14791 606 $aComputer science$xMathematics 606 $aLogic programming 606 $aNatural language processing (Computer science) 606 $aMathematics of Computing 606 $aLogic in AI 606 $aNatural Language Processing (NLP) 615 0$aComputer science$xMathematics. 615 0$aLogic programming. 615 0$aNatural language processing (Computer science). 615 14$aMathematics of Computing. 615 24$aLogic in AI. 615 24$aNatural Language Processing (NLP). 676 $a511.3 702 $aDay$b Joel D. 702 $aManea$b Florin 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 912 $a9910878067403321 996 $aDevelopments in Language Theory$9772277 997 $aUNINA