Cantitate/Preț
Produs
Total produse
Vezi coșul
Developments in Language Theory de Mizuho Hoshi

Developments in Language Theory: Lecture Notes in Computer Science, cartea 11088

Editat de Mizuho Hoshi, Shinnosuke Seki
en Limba Engleză Paperback – 6 aug 2018
This book constitutes the proceedings of the 22nd International Conference on Developments in Language Theory, DLT 2018, held in Tokyo, Japan, in September 2018. The 39 full papers presented  in this volume were carefully reviewed and selected from 84 submissions. The papers cover the following topics and areas: combinatorial and algebraic properties  of words and languages; grammars, acceptors and transducers for strings, trees, graphics, arrays; algebraic theories for automata and languages; codes; efficient text algorithms; symbolic dynamics; decision problems; relationships to complexity theory and logic; picture description and analysis, polyominoes and bidimensional patterns; cryptography; concurrency; celluar automata; bio-inspired computing; quantum computing.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33671 lei

Preț vechi: 42088 lei
-20%

Puncte Express: 505

Carte tipărită la comandă

Livrare economică 07-21 iulie

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783319986531
ISBN-10: 3319986538
Pagini: 584
Ilustrații: XIV, 568 p. 86 illus.
Dimensiuni: 155 x 235 x 32 mm
Greutate: 0.87 kg
Ediția:1st edition 2018
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Block sorting-based transformations on words: beyond the magic BWT.- The Runs Theorem and Beyond.- A Brief Excursion to Parity Games.- A tale of conjunctive grammars.- Groups, languages and dendric shifts.- Some Open Problems in Polyomino Tilings.- Weak Cost Register Automata are Still Powerful.- From Two-Way Transducers to Regular Function Expressions.- Decidability of Right One-Way Jumping Finite Automata.- Additive Number Theory via Approximation by Regular Languages.- Tree-to-graph transductions with scope.- A Characterization of Completely Reachable Automata.- Inequalities for one-step products.- On the commutative equivalence of context-free languages.- Simon's theorem for scattered words.- The Synchronizing Probability Function for Primitive Sets of Matrices.- Recognizability for automata.- Site-Directed Deletion.- Counting Subwords and Regular Languages.- Deque languages, automata and planar graphs.- A General Approach to State Complexity of Operations: Formalization and Limitations.- On Matching Generalised Repetitive Patterns.- Intersection Non-Emptiness and Hardness within Polynomial Time.- Complexity of decision problems on totally rigid acyclic tree grammars.- A Pattern Logic for Automata with Outputs.- The Intersection Problem for Finite Semigroups.- On Completely Reachable Automata and Subset Reachability.- On Minimal Grammar Problems for Finite Languages.- Reversible Pushdown Transducers.- Two-way Automata and One-Tape Machines: Read Only versus Linear Time.- Dynamics of the Independence Number and Automata Synchronization.- Closest Substring Problems for Regular Languages.- Computational Complexity of Decision Problems on Self-Verifying Finite Automata.- Generalizations of Checking Stack Automata: Characterizations and Hierarchies.- On Counting Functions of Languages.- Towards exact state complexity bounds for input-driven pushdown automata.- On Abelian Subshifts.- Reachability Problems in Nondeterministic Polynomial Maps on the Integers.- Projection for Büchi Tree Automata with Constraints between Siblings.- The Computational Power of Parsing Expression Grammars.- On finitely ambiguous Büchi automata.- Uniformization Problem for Variants of First Order Logic over Finite Words.- On deterministic ordered restart-delete automata.- Complementation of Finitely Ambiguous Büchi Automata.- A Structural Lemma for Deterministic Context-Free Languages.