000 05284nam a22006015i 4500
001 978-3-030-81508-0
003 DE-He213
005 20240423125359.0
007 cr nn 008mamaa
008 210714s2021 sz | s |||| 0|eng d
020 _a9783030815080
_9978-3-030-81508-0
024 7 _a10.1007/978-3-030-81508-0
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aDevelopments in Language Theory
_h[electronic resource] :
_b25th International Conference, DLT 2021, Porto, Portugal, August 16–20, 2021, Proceedings /
_cedited by Nelma Moreira, Rogério Reis.
250 _a1st ed. 2021.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2021.
300 _aXVII, 381 p. 52 illus., 12 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12811
505 0 _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.
520 _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; efficient 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. .
650 0 _aComputer science.
650 0 _aNatural language processing (Computer science).
650 0 _aMachine theory.
650 0 _aLogic programming.
650 0 _aDatabase management.
650 1 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aNatural Language Processing (NLP).
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aLogic in AI.
650 2 4 _aDatabase Management.
700 1 _aMoreira, Nelma.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aReis, Rogério.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030815073
776 0 8 _iPrinted edition:
_z9783030815097
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12811
856 4 0 _uhttps://doi.org/10.1007/978-3-030-81508-0
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c177309
_d177309