國立高雄大學圖資館 |

登入

回首頁

Combinatorics on words14th International Conference, WORDS 2023, Umeå, Sweden, June 12-16, 2023 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Combinatorics on wordsedited by Anna Frid, Robert Mercaş.
其他題名:	14th International Conference, WORDS 2023, Umeå, Sweden, June 12-16, 2023 : proceedings /
其他題名:	WORDS 2023
其他作者:	Frid, Anna.
團體作者:
出版者:	Cham :Springer Nature Switzerland :2023.
面頁冊數:	1 online resource (x, 301 p.) :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Combinatorial analysisCongresses.
電子資源:	https://doi.org/10.1007/978-3-031-33180-0
ISBN:	9783031331800$q(electronic bk.)

Combinatorics on words14th International Conference, WORDS 2023, Umeå, Sweden, June 12-16, 2023 : proceedings /
Combinatorics on words14th International Conference, WORDS 2023, Umeå, Sweden, June 12-16, 2023 : proceedings /[electronic resource] :WORDS 2023edited by Anna Frid, Robert Mercaş. - Cham :Springer Nature Switzerland :2023. - 1 online resource (x, 301 p.) :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,138991611-3349 ;. - Lecture notes in computer science ;4891..

Invited Papers: Minimal Complexities for Infinite Words Written with d Letters -- Alternate Base Numeration Systems -- On the number of distinct squares in finite sequences: some old and new results. Contributed Papers: Ranking and Unranking k-Subsequence Universal Words -- Longest common subsequence with gap constraints -- On Substitutions Preserving their Return Sets -- Recurrence and frequencies -- Sturmian and infinitely desubstitutable words accepted by an ω-automaton -- String attractors for factors of the Thue-Morse word -- Critical exponent of Arnoux-Rauzy sequences -- On a class of 2-balanced sequences -- Order conditions for languages -- On Sensitivity of Compact Directed Acyclic Word Graphs -- Smallest and Largest Block Palindrome Factorizations -- String attractors of fixed points of k-bonacci-like morphisms -- Magic Numbers in Periodic Sequences -- Dyck Words, Pattern Avoidance, and Automatic Sequences -- Rudin-Shapiro Sums Via Automata Theory and Logic -- Automaticity and Parikh-collinear morphisms -- On the solution sets of entire systems of word equations -- On arch factorization and subword universality for words and compressed words -- Characteristic sequences of the sets of sums of squares as columns of cellular automata.

This book constitutes the refereed proceedings of the 14th International Conference on Combinatorics on Words, WORDS 2023, held in Umeå, Sweden, during June 12-16, 2023. The 19 contributed papers presented in this book were carefully reviewed and selected from 28 submissions. In addition, the volume also contains 3 invited papers. WORDS is the main conference series devoted to combinatorics on words. This area is connected to several topics from computer science and mathematics, including string algorithms, automated proofs, discrete dynamics, number theory and, of course, classical combinatorics.

ISBN: 9783031331800$q(electronic bk.)

Standard No.: 10.1007/978-3-031-33180-0doiSubjects--Topical Terms:

384513
Combinatorial analysis
--Congresses.

LC Class. No.: QA164 / .W67 2023

Dewey Class. No.: 511.6

Combinatorics on words14th International Conference, WORDS 2023, Umeå, Sweden, June 12-16, 2023 : proceedings /
LDR:03043nmm a2200349 a 4500 001 637681
003 DE-He213
005 20230511235141.0
006 m d
007 cr nn 008maaau
008 230921s2023 sz s 0 eng d
020 $a 9783031331800$q(electronic bk.)
020 $a 9783031331794$q(paper)
024 7 $a 10.1007/978-3-031-33180-0 $2 doi
035 $a 978-3-031-33180-0
040 $a GP $c GP
041 0 $a eng
050 4 $a QA164 $b .W67 2023
072 7 $a UYA $2 bicssc
072 7 $a MAT018000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 511.6 $2 23
090 $a QA164 $b .W924 2023
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Combinatorics on words $h [electronic resource] : $b 14th International Conference, WORDS 2023, Umeå, Sweden, June 12-16, 2023 : proceedings / $c edited by Anna Frid, Robert Mercaş.
246 3 $a WORDS 2023
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2023.
300 $a 1 online resource (x, 301 p.) : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 1611-3349 ; $v 13899
505 0 $a Invited Papers: Minimal Complexities for Infinite Words Written with d Letters -- Alternate Base Numeration Systems -- On the number of distinct squares in finite sequences: some old and new results. Contributed Papers: Ranking and Unranking k-Subsequence Universal Words -- Longest common subsequence with gap constraints -- On Substitutions Preserving their Return Sets -- Recurrence and frequencies -- Sturmian and infinitely desubstitutable words accepted by an ω-automaton -- String attractors for factors of the Thue-Morse word -- Critical exponent of Arnoux-Rauzy sequences -- On a class of 2-balanced sequences -- Order conditions for languages -- On Sensitivity of Compact Directed Acyclic Word Graphs -- Smallest and Largest Block Palindrome Factorizations -- String attractors of fixed points of k-bonacci-like morphisms -- Magic Numbers in Periodic Sequences -- Dyck Words, Pattern Avoidance, and Automatic Sequences -- Rudin-Shapiro Sums Via Automata Theory and Logic -- Automaticity and Parikh-collinear morphisms -- On the solution sets of entire systems of word equations -- On arch factorization and subword universality for words and compressed words -- Characteristic sequences of the sets of sums of squares as columns of cellular automata.
520 $a This book constitutes the refereed proceedings of the 14th International Conference on Combinatorics on Words, WORDS 2023, held in Umeå, Sweden, during June 12-16, 2023. The 19 contributed papers presented in this book were carefully reviewed and selected from 28 submissions. In addition, the volume also contains 3 invited papers. WORDS is the main conference series devoted to combinatorics on words. This area is connected to several topics from computer science and mathematics, including string algorithms, automated proofs, discrete dynamics, number theory and, of course, classical combinatorics.
650 0 $a Combinatorial analysis $v Congresses. $3 384513
650 0 $a Word problems (Mathematics) $3 359953
650 1 4 $a Formal Languages and Automata Theory. $3 914922
650 2 4 $a Computer Communication Networks. $3 218087
650 2 4 $a Algorithms. $3 184661
650 2 4 $a Natural Language Processing (NLP) $3 826373
650 2 4 $a Discrete Mathematics in Computer Science. $3 274791
700 1 $a Frid, Anna. $3 376026
700 1 $a Mercaş, Robert. $3 944162
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
856 4 0 $u https://doi.org/10.1007/978-3-031-33180-0
950 $a Computer Science (SpringerNature-11645)