LEADER 05246nam 22007935 450 001 996534466103316 005 20230518093912.0 010 $a9783031332647$b(electronic bk.) 010 $z9783031332630 024 7 $a10.1007/978-3-031-33264-7 035 $a(MiAaPQ)EBC30546039 035 $a(Au-PeEL)EBL30546039 035 $a(OCoLC)1379805225 035 $a(DE-He213)978-3-031-33264-7 035 $a(BIP)090943858 035 $a(PPN)270612300 035 $a(EXLCZ)9926711710400041 100 $a20230518d2023 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aDevelopments in Language Theory$b[electronic resource] $e27th International Conference, DLT 2023, Umeå, Sweden, June 12?16, 2023, Proceedings /$fedited by Frank Drewes, Mikhail Volkov 205 $a1st ed. 2023. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2023. 215 $a1 online resource (276 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v13911 311 08$aPrint version: Drewes, Frank Developments in Language Theory Cham : Springer International Publishing AG,c2023 9783031332630 327 $aTransducers and the Power of Delay -- When the Map is More Exact than the Terrain -- Formal Languages and the NLP Black Box -- On Structural Tractability Parameters for Hard String Problems -- Jumping Automata over Infinite Words -- Isometric Words based on Swap and Mismatch Distance -- Set Augmented Finite Automata over Infinite Alphabets -- Fast detection of specific fragments against a set of sequences -- Weak Inverse Neighborhoods of Languages -- The exact state complexity for the composition of Root and reversal -- Bit catastrophes for the Burrows-Wheeler Transform -- The Domino problem is undecidable on every rhombus subshift -- Synchronization of Parikh Automata -- Completely Distinguishable Automata and the Set of Synchronizing Words -- Zielonka DAG Acceptance and Regular Languages over Infinite Words -- On Word Representable and Multi-Word Representable Graphs -- On the Simon's Congruence Neighborhood of Languages -- Tree-Walking-Storage Automata -- Rewriting rules for arithmetics in alternate base systems -- Synchronizing Automata with Coinciding Cycles -- Approaching Repetition Thresholds Via Local Resampling and Entropy Compression -- Languages Generated by Conjunctive Query Fragments of FC[REG] -- Groups whose word problems are accepted by abelian G-automata. 330 $aThis book constitutes the refereed proceedings of the 27th International Conference on Developments in Language Theory, DLT 2023, held in Umeå, Sweden, during June 12?16, 2023. The 20 full papers included in this book were carefully reviewed and selected from 32 submissions (31 regular ones and one invited).The DLT conference series provides a forum for presenting current developments informal languages and automata. Its 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 ;$v13911 606 $aComputer science 606 $aMachine theory 606 $aComputer science?Mathematics 606 $aComputer engineering 606 $aComputer networks 606 $aLogic programming 606 $aNatural language processing (Computer science) 606 $aComputer Science Logic and Foundations of Programming 606 $aFormal Languages and Automata Theory 606 $aMathematics of Computing 606 $aComputer Engineering and Networks 606 $aLogic in AI 606 $aNatural Language Processing (NLP) 610 $aLanguage And Languages 610 $aLanguage Arts & Disciplines 615 0$aComputer science. 615 0$aMachine theory. 615 0$aComputer science?Mathematics. 615 0$aComputer engineering. 615 0$aComputer networks. 615 0$aLogic programming. 615 0$aNatural language processing (Computer science). 615 14$aComputer Science Logic and Foundations of Programming. 615 24$aFormal Languages and Automata Theory. 615 24$aMathematics of Computing. 615 24$aComputer Engineering and Networks. 615 24$aLogic in AI. 615 24$aNatural Language Processing (NLP). 676 $a410 700 $aDrewes$b Frank$01358974 701 $aVolkov$b Mikhail$01358975 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 912 $a996534466103316 996 $aDevelopments in Language Theory$93371762 997 $aUNISA