Developments in Language Theory

27th International Conference, DLT 2023, Umeå, Sweden, June 12–16, 2023, Proceedings

AvFrank Drewes,Mikhail Volkov

Häftad, Engelska, 2023

Del 13911 i serien Lecture Notes in Computer Science

717 kr

Beställningsvara. Skickas inom 5-8 vardagar. Fri frakt över 249 kr.

Beskrivning

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

Produktinformation

Utgivningsdatum:2023-05-19
Mått:155 x 235 x 16 mm
Vikt:429 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:259
Förlag:Springer International Publishing AG
ISBN:9783031332630

Utforska kategorier

Systemvetenskap och AI inom Data och IT

Innehållsförteckning

Transducers 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.