國立虎尾科技大學 |

Developments in Language Theory = 25th International Conference, DLT 2021, Porto, Portugal, August 16–20, 2021, Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Developments in Language Theory/ edited by Nelma Moreira, Rogério Reis.
Reminder of title:	25th International Conference, DLT 2021, Porto, Portugal, August 16–20, 2021, Proceedings /
other author:	Moreira, Nelma.
Description:	XVII, 381 p. 52 illus., 12 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Computer logic. -
Online resource:	https://doi.org/10.1007/978-3-030-81508-0
ISBN:	9783030815080

Developments in Language Theory = 25th International Conference, DLT 2021, Porto, Portugal, August 16–20, 2021, Proceedings /
Developments in Language Theory25th International Conference, DLT 2021, Porto, Portugal, August 16–20, 2021, Proceedings /[electronic resource] :edited by Nelma Moreira, Rogério Reis. - 1st ed. 2021. - XVII, 381 p. 52 illus., 12 illus. in color.online resource. - Theoretical Computer Science and General Issues ;12811. - Theoretical Computer Science and General Issues ;9163.

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

This 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; eﬃcient 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. .

ISBN: 9783030815080

Standard No.: 10.1007/978-3-030-81508-0doiSubjects--Topical Terms:

786340
Computer logic.

LC Class. No.: QA76.9.L63

Dewey Class. No.: 005.1015113

Developments in Language Theory = 25th International Conference, DLT 2021, Porto, Portugal, August 16–20, 2021, Proceedings /
LDR:04519nam a22004335i 4500 001 1052219
003 DE-He213
005 20210826170521.0
007 cr nn 008mamaa
008 220103s2021 sz | s |||| 0|eng d
020 $a 9783030815080 $9 978-3-030-81508-0
024 7 $a 10.1007/978-3-030-81508-0 $2 doi
035 $a 978-3-030-81508-0
050 4 $a QA76.9.L63
050 4 $a QA76.5913
072 7 $a UM $2 bicssc
072 7 $a COM051000 $2 bisacsh
072 7 $a UM $2 thema
072 7 $a UYF $2 thema
082 0 4 $a 005.1015113 $2 23
245 1 0 $a Developments in Language Theory $h [electronic resource] : $b 25th International Conference, DLT 2021, Porto, Portugal, August 16–20, 2021, Proceedings / $c edited by Nelma Moreira, Rogério Reis.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XVII, 381 p. 52 illus., 12 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 Theoretical Computer Science and General Issues ; $v 12811
505 0 $a Invited 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 $a This 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; eﬃcient 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 $a Computer logic. $3 786340
650 0 $a Natural language processing (Computer science). $3 802180
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 0 $a Artificial intelligence. $3 559380
650 0 $a Database management. $3 557799
650 1 4 $a Logics and Meanings of Programs. $3 670058
650 2 4 $a Natural Language Processing (NLP). $3 1254293
650 2 4 $a Mathematical Logic and Formal Languages. $3 670059
650 2 4 $a Logic in AI. $3 1228083
650 2 4 $a Database Management. $3 669820
700 1 $a Moreira, Nelma. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 883564
700 1 $a Reis, Rogério. $e editor. $1 https://orcid.org/0000-0001-9211-3712 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1356907
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030815073
776 0 8 $i Printed edition: $z 9783030815097
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-81508-0
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)