| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA990009112460403321 |
|
|
Autore |
Ambrose, Anthony |
|
|
Titolo |
Stimulation in early infancy : proceedings of a C.A.S.D.S. Study Group on "The functions of stimulation in early postnatal development" held jointly with the Ciba Foundation, London, November 1967, being the first study group in a C.A.S.D.S. programme on "The origins of human behaviour" / Anthony Ambrose |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
London ; New York : Academic Press, 1969 |
|
|
|
|
|
|
|
Descrizione fisica |
|
XVI, 289 p. : ill. ; 24 cm |
|
|
|
|
|
|
Locazione |
|
|
|
|
|
|
Collocazione |
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
2. |
Record Nr. |
UNINA990005424010403321 |
|
|
Autore |
Burnet, John <1863-1928> |
|
|
Titolo |
Early Greek Philosophy / John Burnet |
|
|
|
|
|
Pubbl/distr/stampa |
|
|
London, : Adam and Charles Black, 1892 |
|
|
|
|
|
|
|
Descrizione fisica |
|
|
|
|
|
|
Locazione |
|
|
|
|
|
|
Collocazione |
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
|
|
|
|
|
|
|
3. |
Record Nr. |
UNINA9910728947403321 |
|
|
Autore |
Frid Anna |
|
|
Titolo |
Combinatorics on Words : 14th International Conference, WORDS 2023, Umeå, Sweden, June 12–16, 2023, Proceedings / / edited by Anna Frid, Robert Mercaş |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
|
|
Edizione |
[1st ed. 2023.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (310 pages) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 1611-3349 ; ; 13899 |
|
|
|
|
|
|
Altri autori (Persone) |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
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 |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
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. |
|
|
|
|
|
|
Sommario/riassunto |
|
This book constitutes the refereed proceedings of the 14th International Conference on Combinatorics on Words, WORDS 2023, held in Umeå, 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. |
|
|
|
|
|
|
|
| |