Frid anna (22 Ergebnisse)

Zustand: New. In English.

Zustand: New. In English.

Zustand: New. pp. 384.

Paperback. Zustand: Brand New. 2009 edition. 369 pages. 9.10x6.00x0.40 inches. In Stock.

Zustand: New.

Zustand: New. In English.

Zustand: New. pp. 312.

Paperback. Zustand: Brand New. 311 pages. 9.25x6.10x0.65 inches. In Stock.

Taschenbuch. Zustand: Neu. Combinatorics on Words | 14th International Conference, WORDS 2023, Umeå, Sweden, June 12-16, 2023, Proceedings | Anna Frid (u. a.) | Taschenbuch | Lecture Notes in Computer Science | x | Englisch | 2023 | Springer | EAN 9783031331794 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …

Zustand: Hervorragend. Zustand: Hervorragend | Seiten: 312 | Sprache: Englisch | Produktart: Bücher | 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.…

Zustand: new. Questo è un articolo print on demand.

Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The 4th International Computer Science Symposium in Russia (CSR 2009) was held August 18 23,2009 in Novosibirsk,Russia, hosted by the Sobolev Institute of Mathematics and Novosibirsk State University. It was the fourth event in the series of regular international meetings, following CSR 2006 in St. Petersburg, CSR 2007 in Ekaterinburg, and CSR 2008 in Moscow. The opening lecture was given by Andrei Voronkov, and four other invited plenary lectures were given by Sergei Odintsov, Wolfgang Thomas, Nikolai Vereshchagin, and Hongseok Yang. This volume contains all the accepted papers and some of the abstracts of the invited speakers. The scope of the proposed topics for the symposium was quite broad and covered basically all areas of computer science. We received 66 papers in total, and the Program Committee selected 29. Yandex provided the Best Student Paper Awards; the recepients of these awards were selected by the Program Committee: Dmitry Itsykson, Structural complexity of AvgBPP Yuri Pritykin and Julya Ulyashkina, Aperiodicity measure for in nite sequences. The reviewing processwasorganizedusing the EasyChairconferencesystem, created by Andrei Voronkov. We are grateful to our sponsors: Russian Foundation for Basic Research Yandex (the largest Russian Internet portal providing key Web services). We also thank the group of local organizers and in particular Pavel Salimov. 384 pp. Englisch.…

Zustand: New. Print on Demand pp. 384 Illus.

Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Invited Papers.- Well-Founded and Partial Stable Semantics Logical Aspects.- The Reachability Problem over Infinite Graphs.- Kolmogorov Complexity and Model Selection.- Automatic Verification of Heap-Manipulating Programs Using Separation Logic.- Accepted P.…

Zustand: New. PRINT ON DEMAND pp. 384.

Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - The 4th International Computer Science Symposium in Russia (CSR 2009) was held August 18 23,2009 in Novosibirsk,Russia, hosted by the Sobolev Institute of Mathematics and Novosibirsk State University. It was the fourth event in the series of regular international meetings, following CSR 2006 in St. Petersburg, CSR 2007 in Ekaterinburg, and CSR 2008 in Moscow. The opening lecture was given by Andrei Voronkov, and four other invited plenary lectures were given by Sergei Odintsov, Wolfgang Thomas, Nikolai Vereshchagin, and Hongseok Yang. This volume contains all the accepted papers and some of the abstracts of the invited speakers. The scope of the proposed topics for the symposium was quite broad and covered basically all areas of computer science. We received 66 papers in total, and the Program Committee selected 29. Yandex provided the Best Student Paper Awards; the recepients of these awards were selected by the Program Committee: Dmitry Itsykson, Structural complexity of AvgBPP Yuri Pritykin and Julya Ulyashkina, Aperiodicity measure for in nite sequences. The reviewing processwasorganizedusing the EasyChairconferencesystem, created by Andrei Voronkov. We are grateful to our sponsors: Russian Foundation for Basic Research Yandex (the largest Russian Internet portal providing key Web services). We also thank the group of local organizers and in particular Pavel Salimov.…

Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 312 pp. Englisch.…

Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Invited Papers.- Well-Founded and Partial Stable Semantics Logical Aspects.- The Reachability Problem over Infinite Graphs.- Kolmogorov Complexity and Model Selection.- Automatic Verification of Heap-Manipulating Programs Using Separation Logic.- Accepted Papers.- Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism.- Integrality Property in Preemptive Parallel Machine Scheduling.- Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes.- k-SAT Is No Harder Than Decision-Unique-k-SAT.- Unique Decipherability in the Monoid of Languages: An Application of Rational Relations.- Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model.- Approximability Distance in the Space of H-Colourability Problems.- On Random Ordering Constraints.- Depth Reduction for Circuits with a Single Layer of Modular Counting Gates.- A Feebly Secure Trapdoor Function.- Partitioning Graphs into Connected Parts.- Structural Complexity of AvgBPP.- Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials.- Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity.- One-Nonterminal Conjunctive Grammars over a Unary Alphabet.- Concatenation of Regular Languages and Descriptional Complexity.- Approximability of the Maximum Solution Problem for Certain Families of Algebras.- Complete Complexity Classification of Short Shop Scheduling.- Compressed Word Problems in HNN-Extensions and Amalgamated Products.- Variations on Muchnik's Conditional Complexity Theorem.- An Optimal Bloom Filter Replacement Based on Matrix Solving.- Aperiodicity Measure for Infinite Sequences.- On the Complexity of Matroid Isomorphism Problems.- Breaking Anonymity byLearning a Unique Minimum Hitting Set.- The Budgeted Unique Coverage Problem and Color-Coding.- Formal Verification of Gate-Level Computer Systems.- On Models of a Nondeterministic Computation.- New Plain-Exponential Time Classes for Graph Homomorphism.- Languages Recognized with Unbounded Error by Quantum Finite Automata.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 384 pp. Englisch.…

Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.…

Zustand: New. Print on Demand pp. 312.

Zustand: New. PRINT ON DEMAND pp. 312.

Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -¿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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 312 pp. Englisch. …