000 04806nam a22005655i 4500
001 978-3-031-66159-4
003 DE-He213
005 20250516160110.0
007 cr nn 008mamaa
008 240726s2024 sz | s |||| 0|eng d
020 _a9783031661594
_9978-3-031-66159-4
050 4 _aQA76.9.M35
072 7 _aUYAM
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYAM
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aDevelopments in Language Theory
_h[electronic resource] :
_b28th International Conference, DLT 2024, Göttingen, Germany, August 12-16, 2024, Proceedings /
_cedited by Joel D. Day, Florin Manea.
250 _a1st ed. 2024.
264 1 _aCham :
_bSpringer Nature Switzerland :
_bImprint: Springer,
_c2024.
300 _aXIV, 298 p. 48 illus., 17 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 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v14791
505 0 _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.
520 _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. .
541 _fUABC ;
_cPerpetuidad
650 0 _aComputer science
_xMathematics.
650 0 _aLogic programming.
650 0 _aNatural language processing (Computer science).
650 1 4 _aMathematics of Computing.
650 2 4 _aLogic in AI.
650 2 4 _aNatural Language Processing (NLP).
700 1 _aDay, Joel D.
_eeditor.
_0(orcid)0000-0002-3660-7766
_1https://orcid.org/0000-0002-3660-7766
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aManea, Florin.
_eeditor.
_0(orcid)0000-0001-6094-3324
_1https://orcid.org/0000-0001-6094-3324
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031661587
776 0 8 _iPrinted edition:
_z9783031661600
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v14791
856 4 0 _zLibro electrónico
_uhttp://libcon.rec.uabc.mx:2048/login?url=https://doi.org/10.1007/978-3-031-66159-4
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cLIBRO_ELEC
999 _c275806
_d275805