國立虎尾科技大學 |

Developments in Language Theory = 24th International Conference, DLT 2020, Tampa, FL, USA, May 11–15, 2020, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Developments in Language Theory/ edited by Nataša Jonoska, Dmytro Savchuk.
其他題名:	24th International Conference, DLT 2020, Tampa, FL, USA, May 11–15, 2020, Proceedings /
其他作者:	Jonoska, Nataša.
面頁冊數:	X, 333 p. 271 illus., 5 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Computer logic. -
電子資源:	https://doi.org/10.1007/978-3-030-48516-0
ISBN:	9783030485160

Developments in Language Theory = 24th International Conference, DLT 2020, Tampa, FL, USA, May 11–15, 2020, Proceedings /
Developments in Language Theory24th International Conference, DLT 2020, Tampa, FL, USA, May 11–15, 2020, Proceedings /[electronic resource] :edited by Nataša Jonoska, Dmytro Savchuk. - 1st ed. 2020. - X, 333 p. 271 illus., 5 illus. in color.online resource. - Theoretical Computer Science and General Issues ;12086. - Theoretical Computer Science and General Issues ;9163.

Equational Theories of Scattered and Countable Series-parallel Posets -- Scattered Factor-Universality of Words -- On Normalish Subgroups of the R. Thompson’s Groups -- Computing the Shortest String and the Edit-Distance for Parsing Expression Languages -- An Approach to the Herzog-Schonheim Conjecture Using Automata -- On the Fine Grained Complexity of Finite Automata Non-Emptiness of Intersection -- The State Complexity of Lexicographically Smallest Words and Computing Successors -- Reconstructing Words from Right-Bounded-Block Words -- A Study of a Simple Class of Modifiers : Product Modifiers -- Operations on Permutation Automata -- Space Complexity of Stack Automata Models -- Descriptional Complexity of Semi-Simple Splicing Systems -- On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations -- Dynamics of Cellular Automata on Beta-Shifts and Direct Topological Factorizations -- Avoidability of Additive Cubes over Alphabets of Four Numbers -- Equivalence of Linear Tree Transducers with Output in the Free Group -- On the Balancedness of Tree-to-word Transducers -- On Tree Substitution Grammars -- Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata -- Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices -- Avoiding 5/4-powers on the Alphabet of Nonnegative Integers (Extended Abstract) -- Transition Property for α-Power Free Languages with α ≥ 2 and k ≥ 3 Letters -- Context-Freeness of Word-MIX Languages -- The Characterization of the Minimal Paths in the Christoﬀel Tree According to a Second-order Balancedness.

This book constitutes the proceedings of the 24th International Conference on Developments in Language Theory, DLT 2020, which was due to be held in Tampa, Florida, USA, in May 2020. The conference was cancelled due to the COVID-19 pandemic. The 24 full papers presented were carefully reviewed and selected from 38 submissions. The papers present current developments in language theory, formal languages, automata theory and related areas, such as algorithmic, combinatorial, and algebraic properties of words and languages, cellular automata, algorithms on words, etc.

ISBN: 9783030485160

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

786340
Computer logic.

LC Class. No.: QA76.9.L63

Dewey Class. No.: 005.1015113

Developments in Language Theory = 24th International Conference, DLT 2020, Tampa, FL, USA, May 11–15, 2020, Proceedings /
LDR:03739nam a22004335i 4500 001 1028118
003 DE-He213
005 20200630131202.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783030485160 $9 978-3-030-48516-0
024 7 $a 10.1007/978-3-030-48516-0 $2 doi
035 $a 978-3-030-48516-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 24th International Conference, DLT 2020, Tampa, FL, USA, May 11–15, 2020, Proceedings / $c edited by Nataša Jonoska, Dmytro Savchuk.
250 $a 1st ed. 2020.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a X, 333 p. 271 illus., 5 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 12086
505 0 $a Equational Theories of Scattered and Countable Series-parallel Posets -- Scattered Factor-Universality of Words -- On Normalish Subgroups of the R. Thompson’s Groups -- Computing the Shortest String and the Edit-Distance for Parsing Expression Languages -- An Approach to the Herzog-Schonheim Conjecture Using Automata -- On the Fine Grained Complexity of Finite Automata Non-Emptiness of Intersection -- The State Complexity of Lexicographically Smallest Words and Computing Successors -- Reconstructing Words from Right-Bounded-Block Words -- A Study of a Simple Class of Modifiers : Product Modifiers -- Operations on Permutation Automata -- Space Complexity of Stack Automata Models -- Descriptional Complexity of Semi-Simple Splicing Systems -- On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations -- Dynamics of Cellular Automata on Beta-Shifts and Direct Topological Factorizations -- Avoidability of Additive Cubes over Alphabets of Four Numbers -- Equivalence of Linear Tree Transducers with Output in the Free Group -- On the Balancedness of Tree-to-word Transducers -- On Tree Substitution Grammars -- Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata -- Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices -- Avoiding 5/4-powers on the Alphabet of Nonnegative Integers (Extended Abstract) -- Transition Property for α-Power Free Languages with α ≥ 2 and k ≥ 3 Letters -- Context-Freeness of Word-MIX Languages -- The Characterization of the Minimal Paths in the Christoﬀel Tree According to a Second-order Balancedness.
520 $a This book constitutes the proceedings of the 24th International Conference on Developments in Language Theory, DLT 2020, which was due to be held in Tampa, Florida, USA, in May 2020. The conference was cancelled due to the COVID-19 pandemic. The 24 full papers presented were carefully reviewed and selected from 38 submissions. The papers present current developments in language theory, formal languages, automata theory and related areas, such as algorithmic, combinatorial, and algebraic properties of words and languages, cellular automata, algorithms on words, etc.
650 0 $a Computer logic. $3 786340
650 0 $a Natural language processing (Computer science). $3 802180
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Computers. $3 565115
650 0 $a Artificial intelligence. $3 559380
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 Mathematics of Computing. $3 669457
650 2 4 $a Information Systems and Communication Service. $3 669203
650 2 4 $a Logic in AI. $3 1228083
700 1 $a Jonoska, Nataša. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1274514
700 1 $a Savchuk, Dmytro. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1324631
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030485153
776 0 8 $i Printed edition: $z 9783030485177
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-48516-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)