國立虎尾科技大學 |

Combinatorics on Words = 12th International Conference, WORDS 2019, Loughborough, UK, September 9–13, 2019, Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Combinatorics on Words/ edited by Robert Mercaş, Daniel Reidenbach.
Reminder of title:	12th International Conference, WORDS 2019, Loughborough, UK, September 9–13, 2019, Proceedings /
other author:	Mercaş, Robert.
Description:	XIV, 327 p. 300 illus., 6 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Mathematical logic. -
Online resource:	https://doi.org/10.1007/978-3-030-28796-2
ISBN:	9783030287962

Combinatorics on Words = 12th International Conference, WORDS 2019, Loughborough, UK, September 9–13, 2019, Proceedings /
Combinatorics on Words12th International Conference, WORDS 2019, Loughborough, UK, September 9–13, 2019, Proceedings /[electronic resource] :edited by Robert Mercaş, Daniel Reidenbach. - 1st ed. 2019. - XIV, 327 p. 300 illus., 6 illus. in color.online resource. - Theoretical Computer Science and General Issues ;11682. - Theoretical Computer Science and General Issues ;9163.

Matching patterns with variables -- Abelian properties of words -- On sets of words of rank two -- On families of limit S-adic words -- Independent systems of word equations: from Ehrenfeucht to eighteen -- Parikh determinants -- Critical exponent of infinite balanced words via the Pell number system -- Repetitions in infinite palindrome-rich words -- Generalized Lyndon factorizations of infinite words -- On the commutative equivalence of bounded semi-linear codes -- Circularly squarefree words and unbordered conjugates: a new approach -- The undirected repetition threshold -- Characteristic parameters and special trapezoidal words -- Return words and bifix codes in eventually dendric sets -- Enumeration and extensions of word-representable graphs -- Localisation-resistant random words with small alphabets -- On codeword lengths guaranteeing synchronization -- Binary intersection revisited -- On substitutions closed under derivation: examples -- Templates for the k-binomial complexity of the Tribonacci word -- Derived sequences of Arnoux-Rauzy sequences -- New results on pseudosquare avoidance -- Every nonnegative real number is a critical abelian exponent -- Rich words containing two given factors -- Mortality and synchronization of unambiguous finite automata -- On discrete idempotent paths.

This book constitutes the refereed proceedings of the 12th International Conference on Combinatorics on Words, WORDS 2019, held in Loughborough, UK, in September 2019. The 21 revised full papers presented in this book together with 5 invited talks were carefully reviewed and selected from 34 submissions. WORDS is the main conference series devoted to the mathematical theory of words. In particular, the combinatorial, algebraic and algorithmic aspects of words are emphasized. Motivations may also come from other domains such as theoretical computer science, bioinformatics, digital geometry, symbolic dynamics, numeration systems, text processing, number theory, etc.

ISBN: 9783030287962

Standard No.: 10.1007/978-3-030-28796-2doiSubjects--Topical Terms:

810627
Mathematical logic.

LC Class. No.: QA8.9-10.3

Dewey Class. No.: 005.131

Combinatorics on Words = 12th International Conference, WORDS 2019, Loughborough, UK, September 9–13, 2019, Proceedings /
LDR:03476nam a22004095i 4500 001 1008596
003 DE-He213
005 20200703224229.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030287962 $9 978-3-030-28796-2
024 7 $a 10.1007/978-3-030-28796-2 $2 doi
035 $a 978-3-030-28796-2
050 4 $a QA8.9-10.3
072 7 $a UYA $2 bicssc
072 7 $a MAT018000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 005.131 $2 23
245 1 0 $a Combinatorics on Words $h [electronic resource] : $b 12th International Conference, WORDS 2019, Loughborough, UK, September 9–13, 2019, Proceedings / $c edited by Robert Mercaş, Daniel Reidenbach.
250 $a 1st ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a XIV, 327 p. 300 illus., 6 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 11682
505 0 $a Matching patterns with variables -- Abelian properties of words -- On sets of words of rank two -- On families of limit S-adic words -- Independent systems of word equations: from Ehrenfeucht to eighteen -- Parikh determinants -- Critical exponent of infinite balanced words via the Pell number system -- Repetitions in infinite palindrome-rich words -- Generalized Lyndon factorizations of infinite words -- On the commutative equivalence of bounded semi-linear codes -- Circularly squarefree words and unbordered conjugates: a new approach -- The undirected repetition threshold -- Characteristic parameters and special trapezoidal words -- Return words and bifix codes in eventually dendric sets -- Enumeration and extensions of word-representable graphs -- Localisation-resistant random words with small alphabets -- On codeword lengths guaranteeing synchronization -- Binary intersection revisited -- On substitutions closed under derivation: examples -- Templates for the k-binomial complexity of the Tribonacci word -- Derived sequences of Arnoux-Rauzy sequences -- New results on pseudosquare avoidance -- Every nonnegative real number is a critical abelian exponent -- Rich words containing two given factors -- Mortality and synchronization of unambiguous finite automata -- On discrete idempotent paths.
520 $a This book constitutes the refereed proceedings of the 12th International Conference on Combinatorics on Words, WORDS 2019, held in Loughborough, UK, in September 2019. The 21 revised full papers presented in this book together with 5 invited talks were carefully reviewed and selected from 34 submissions. WORDS is the main conference series devoted to the mathematical theory of words. In particular, the combinatorial, algebraic and algorithmic aspects of words are emphasized. Motivations may also come from other domains such as theoretical computer science, bioinformatics, digital geometry, symbolic dynamics, numeration systems, text processing, number theory, etc.
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 0 $a Artificial intelligence. $3 559380
650 0 $a Computer logic. $3 786340
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Optical data processing. $3 639187
650 0 $a Data structures (Computer science). $3 680370
650 1 4 $a Mathematical Logic and Formal Languages. $3 670059
650 2 4 $a Logic in AI. $3 1228083
650 2 4 $a Mathematics of Computing. $3 669457
650 2 4 $a Computer Imaging, Vision, Pattern Recognition and Graphics. $3 671334
650 2 4 $a Data Structures. $3 669824
700 1 $a Mercaş, Robert. $e editor. $1 https://orcid.org/0000-0001-6034-433X $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1302437
700 1 $a Reidenbach, Daniel. $e editor. $1 https://orcid.org/0000-0001-7996-5291 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1302438
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030287955
776 0 8 $i Printed edition: $z 9783030287979
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-28796-2
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)