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.
Combinatorics on Words [[electronic resource] ] : 14th International Conference, WORDS 2023, Umeå, Sweden, June 12–16, 2023, Proceedings / / edited by Anna Frid, Robert Mercaş
| Combinatorics on Words [[electronic resource] ] : 14th International Conference, WORDS 2023, Umeå, Sweden, June 12–16, 2023, Proceedings / / edited by Anna Frid, Robert Mercaş |
| Autore | Frid Anna |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (310 pages) |
| Disciplina | 511.6 |
| Altri autori (Persone) | MercaşRobert |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Machine theory
Computer networks Algorithms Natural language processing (Computer science) Computer science—Mathematics Discrete mathematics Formal Languages and Automata Theory Computer Communication Networks Natural Language Processing (NLP) Discrete Mathematics in Computer Science |
| Soggetto non controllato | Mathematics |
| ISBN | 3-031-33180-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Record Nr. | UNISA-996534463603316 |
Frid Anna
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorics on Words : 14th International Conference, WORDS 2023, Umeå, Sweden, June 12–16, 2023, Proceedings / / edited by Anna Frid, Robert Mercaş
| Combinatorics on Words : 14th International Conference, WORDS 2023, Umeå, Sweden, June 12–16, 2023, Proceedings / / edited by Anna Frid, Robert Mercaş |
| Autore | Frid Anna |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (310 pages) |
| Disciplina | 511.6 |
| Altri autori (Persone) | MercaşRobert |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Machine theory
Computer networks Algorithms Natural language processing (Computer science) Computer science—Mathematics Discrete mathematics Formal Languages and Automata Theory Computer Communication Networks Natural Language Processing (NLP) Discrete Mathematics in Computer Science |
| Soggetto non controllato | Mathematics |
| ISBN | 3-031-33180-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Record Nr. | UNINA-9910728947403321 |
|
Frid Anna
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
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 | ||
| ||
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 | ||
| ||