LEADER 05371nam 22006855 450 001 996464399003316 005 20230329224931.0 010 $a3-030-81508-0 024 7 $a10.1007/978-3-030-81508-0 035 $a(CKB)4100000011995496 035 $a(DE-He213)978-3-030-81508-0 035 $a(MiAaPQ)EBC6691551 035 $a(Au-PeEL)EBL6691551 035 $a(PPN)257350411 035 $a(EXLCZ)994100000011995496 100 $a20210714d2021 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aDevelopments in Language Theory$b[electronic resource] $e25th International Conference, DLT 2021, Porto, Portugal, August 16?20, 2021, Proceedings /$fedited by Nelma Moreira, Rogério Reis 205 $a1st ed. 2021. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2021. 215 $a1 online resource (XVII, 381 p. 52 illus., 12 illus. in color.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12811 311 $a3-030-81507-2 327 $aInvited Talks -- Morphic sequences versus automatic sequences -- Parsimonious Computational Completeness Pointlike sets and separation: a personal perspective -- Regular Papers -- A strong non-overlapping Dyck code -- Active Learning of Sequential Transducers with Side Information about the Domain -- Compositions of Constant Weighted Extended Tree Transducers -- Extremal Binary PFAs in a Cerny Family -- Variations on the Post Correspondence Problem for Free Groups -- Reducing local alphabet size in recognizable picture languages -- Properties of Graphs Specified by a Regular Language -- Balanced-by-construction regular and omega-regular languages -- Weighted Prefix Normal Words: Mind the Gap -- Two-Way Non-Uniform Finite Automata -- Integer Weighted Automata on Infinite Words -- Deciding FO2 Alternation for Automata over Finite and Infinite Words -- State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters -- Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata -- Lyndon words formalized in Isabelle/HOL -- The Range of State Complexities of Languages Resulting from the Cascade Product?The General Case (Extended Abstract) -- Second-order finite automata: expressive power and simple proofs using automatic structures -- Reversible Top-Down Syntax Analysis -- Symmetry groups of infinite words -- Bounded Languages Described by GF(2)-grammas -- Definability Results for Top-Down Tree Transducers -- The hardest LL(k) language -- Upper Bounds on Distinct Maximal (Sub-)Repetitions in Compressed Strings -- Branching Frequency and Markov Entropy of Repetition-Free Languages -- A Linear-time Simulation of Deterministic d-Limited Automata -- Caratheodory Extensions of Subclasses of Regular Languages -- Parikh Word Representable Graphs and Morphisms. 330 $aThis book constitutes the proceedings of the 25th International Conference on Developments in Language Theory, DLT 2021, which was held in Porto, Portugal, during August 16-20, 2021. The conference took place in an hybrid format with both in-person and online participation. The 27 full papers included in these proceedings were carefully reviewed and selected from 48 submissions. The DLT conference series provides a forum for presenting current developments in formal 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; algebraic theories of automata; algorithmic, combinatorial, and algebraic properties of words and languages; variable length codes; symbolic dynamics; cellular automata; polyominoes and multidimensional patterns; decidability questions; image manipulation and compression; e?cient text algorithms; relationships to cryptography, concurrency, complexity theory, and logic; bio-inspired computing; quantum computing. The book also includes 3 invited talks in full paper length. . 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12811 606 $aComputer science 606 $aNatural language processing (Computer science) 606 $aMachine theory 606 $aLogic programming 606 $aDatabase management 606 $aComputer Science Logic and Foundations of Programming 606 $aNatural Language Processing (NLP) 606 $aFormal Languages and Automata Theory 606 $aLogic in AI 606 $aDatabase Management 615 0$aComputer science. 615 0$aNatural language processing (Computer science). 615 0$aMachine theory. 615 0$aLogic programming. 615 0$aDatabase management. 615 14$aComputer Science Logic and Foundations of Programming. 615 24$aNatural Language Processing (NLP). 615 24$aFormal Languages and Automata Theory. 615 24$aLogic in AI. 615 24$aDatabase Management. 676 $a511.3 702 $aMoreira$b Nelma 702 $aReis$b Roge?rio$c(Cryptographer), 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996464399003316 996 $aDevelopments in Language Theory$9772277 997 $aUNISA