東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Developments in language theory = 27...

Conference on Developments in Language Theory (2023 :)

Linked to FindBook

Google Book

Amazon

博客來

Developments in language theory = 27th International Conference, DLT 2023, Umeå, Sweden, June 12-16, 2023 : proceedings /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Developments in language theory/ edited by Frank Drewes, Mikhail Volkov.
Reminder of title:	27th International Conference, DLT 2023, Umeå, Sweden, June 12-16, 2023 : proceedings /
remainder title:	DLT 2023
other author:	Drewes, Frank.
corporate name:	Conference on Developments in Language Theory
Published:	Cham :Springer Nature Switzerland : : 2023.,
Description:	1 online resource (xx, 259 p.) :ill. (some col.), digital ;24 cm.
[NT 15003449]:	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.
Contained By:	Springer Nature eBook
Subject:	Formal languages - Congresses. -
Online resource:	https://doi.org/10.1007/978-3-031-33264-7
ISBN:	9783031332647

Developments in language theory = 27th International Conference, DLT 2023, Umeå, Sweden, June 12-16, 2023 : proceedings /
Developments in language theory27th International Conference, DLT 2023, Umeå, Sweden, June 12-16, 2023 : proceedings /[electronic resource] :DLT 2023edited by Frank Drewes, Mikhail Volkov. - Cham :Springer Nature Switzerland :2023. - 1 online resource (xx, 259 p.) :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,139111611-3349 ;. - Lecture notes in computer science ;13911..

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.

This book constitutes the refereed proceedings of the 27th International Conference on Developments in Language Theory, DLT 2023, held in Umeå, Sweden, during June 12-16, 2023. The 20 full papers included in this book were carefully reviewed and selected from 32 submissions (31 regular ones and one invited)The DLT conference series provides a forum for presenting current developments informal 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; 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.

ISBN: 9783031332647

Standard No.: 10.1007/978-3-031-33264-7doiSubjects--Topical Terms:

546808
Formal languages
--Congresses.

LC Class. No.: QA267.3

Dewey Class. No.: 005.131

Developments in language theory = 27th International Conference, DLT 2023, Umeå, Sweden, June 12-16, 2023 : proceedings /
LDR:03576nmm a2200349 a 4500 001 2318566
003 DE-He213
005 20230518093912.0
006 m d
007 cr nn 008maaau
008 230902s2023 sz s 0 eng d
020 $a 9783031332647 $q (electronic bk.)
020 $a 9783031332630 $q (paper)
024 7 $a 10.1007/978-3-031-33264-7 $2 doi
035 $a 978-3-031-33264-7
040 $a GP $c GP
041 0 $a eng
050 4 $a QA267.3
072 7 $a UYA $2 bicssc
072 7 $a COM051000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 005.131 $2 23
090 $a QA267.3 $b .C748 2023
111 2 $a Conference on Developments in Language Theory $n (27th : $d 2023 : $c Umeå, Sweden) $3 3633681
245 1 0 $a Developments in language theory $h [electronic resource] : $b 27th International Conference, DLT 2023, Umeå, Sweden, June 12-16, 2023 : proceedings / $c edited by Frank Drewes, Mikhail Volkov.
246 3 $a DLT 2023
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2023.
300 $a 1 online resource (xx, 259 p.) : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 1611-3349 ; $v 13911
505 0 $a 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.
520 $a This book constitutes the refereed proceedings of the 27th International Conference on Developments in Language Theory, DLT 2023, held in Umeå, Sweden, during June 12-16, 2023. The 20 full papers included in this book were carefully reviewed and selected from 32 submissions (31 regular ones and one invited)The DLT conference series provides a forum for presenting current developments informal 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; 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 Formal languages $v Congresses. $3 546808
650 1 4 $a Computer Science Logic and Foundations of Programming. $3 3538531
650 2 4 $a Formal Languages and Automata Theory. $3 3592087
650 2 4 $a Mathematics of Computing. $3 891213
650 2 4 $a Computer Engineering and Networks. $3 3538504
650 2 4 $a Logic in AI. $3 3386372
650 2 4 $a Natural Language Processing (NLP) $3 3381674
700 1 $a Drewes, Frank. $3 2157688
700 1 $a Volkov, Mikhail. $3 3597927
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 13911. $3 3633682
856 4 0 $u https://doi.org/10.1007/978-3-031-33264-7
950 $a Computer Science (SpringerNature-11645)