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] ] : 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
Opac: Controlla la disponibilità qui
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
Opac: Controlla la disponibilità qui