top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Combinatorics on Words [[electronic resource] ] : 12th International Conference, WORDS 2019, Loughborough, UK, September 9–13, 2019, Proceedings / / edited by Robert Mercaş, Daniel Reidenbach
Combinatorics on Words [[electronic resource] ] : 12th International Conference, WORDS 2019, Loughborough, UK, September 9–13, 2019, Proceedings / / edited by Robert Mercaş, Daniel Reidenbach
Edizione [1st ed. 2019.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Descrizione fisica 1 online resource (XIV, 327 p. 300 illus., 6 illus. in color.)
Disciplina 511.6
Collana Theoretical Computer Science and General Issues
Soggetto topico Machine theory
Logic programming
Computer science—Mathematics
Image processing—Digital techniques
Computer vision
Artificial intelligence—Data processing
Formal Languages and Automata Theory
Logic in AI
Mathematics of Computing
Computer Imaging, Vision, Pattern Recognition and Graphics
Data Science
ISBN 3-030-28796-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 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.
Record Nr. UNISA-996466441503316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Combinatorics on Words : 12th International Conference, WORDS 2019, Loughborough, UK, September 9–13, 2019, Proceedings / / edited by Robert Mercaş, Daniel Reidenbach
Combinatorics on Words : 12th International Conference, WORDS 2019, Loughborough, UK, September 9–13, 2019, Proceedings / / edited by Robert Mercaş, Daniel Reidenbach
Edizione [1st ed. 2019.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Descrizione fisica 1 online resource (XIV, 327 p. 300 illus., 6 illus. in color.)
Disciplina 511.6
Collana Theoretical Computer Science and General Issues
Soggetto topico Machine theory
Logic programming
Computer science—Mathematics
Image processing—Digital techniques
Computer vision
Artificial intelligence—Data processing
Formal Languages and Automata Theory
Logic in AI
Mathematics of Computing
Computer Imaging, Vision, Pattern Recognition and Graphics
Data Science
ISBN 3-030-28796-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 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.
Record Nr. UNINA-9910349301203321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui