Developments in Language Theory 28th International Conference, DLT 2024, Göttingen, Germany, August 12–16, 2024, Proceedings /

This 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 submissi...

وصف كامل

محفوظ في:
التفاصيل البيبلوغرافية
مؤلف مشترك: SpringerLink (Online service)
مؤلفون آخرون: Day, Joel D. (المحرر), Manea, Florin (المحرر)
التنسيق: الكتروني كتاب الكتروني
اللغة:الإنجليزية
منشور في: Cham : Springer Nature Switzerland : Imprint: Springer, 2024.
الطبعة:1st ed. 2024.
سلاسل:Lecture Notes in Computer Science, 14791
الموضوعات:
الوصول للمادة أونلاين:https://doi.org/10.1007/978-3-031-66159-4
الوسوم: إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!

MARC

LEADER 00000nam a22000005i 4500
001 978-3-031-66159-4
003 DE-He213
005 20251225194959.0
007 cr nn 008mamaa
008 240726s2024 sz | s |||| 0|eng d
020 |a 9783031661594  |9 978-3-031-66159-4 
024 7 |a 10.1007/978-3-031-66159-4  |2 doi 
050 4 |a QA76.9.M35 
072 7 |a UYAM  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a UYAM  |2 thema 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a Developments in Language Theory  |h [electronic resource] :  |b 28th International Conference, DLT 2024, Göttingen, Germany, August 12–16, 2024, Proceedings /  |c edited by Joel D. Day, Florin Manea. 
250 |a 1st ed. 2024. 
264 1 |a Cham :  |b Springer Nature Switzerland :  |b Imprint: Springer,  |c 2024. 
300 |a XIV, 298 p. 48 illus., 17 illus. in color.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 1611-3349 ;  |v 14791 
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 |a This 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. . 
650 0 |a Computer science  |x Mathematics. 
650 0 |a Logic programming. 
650 0 |a Natural language processing (Computer science). 
650 1 4 |a Mathematics of Computing. 
650 2 4 |a Logic in AI. 
650 2 4 |a Natural Language Processing (NLP). 
700 1 |a Day, Joel D.  |e editor.  |0 (orcid)0000-0002-3660-7766  |1 https://orcid.org/0000-0002-3660-7766  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Manea, Florin.  |e editor.  |0 (orcid)0000-0001-6094-3324  |1 https://orcid.org/0000-0001-6094-3324  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783031661587 
776 0 8 |i Printed edition:  |z 9783031661600 
830 0 |a Lecture Notes in Computer Science,  |x 1611-3349 ;  |v 14791 
856 4 0 |u https://doi.org/10.1007/978-3-031-66159-4 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-SXPS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710) 
950 |a Springer Nature Proceedings Computer Science (SpringerNature-85344)