Atjaunināt sīkdatņu piekrišanu

E-grāmata: Developments in Language Theory: 19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015, Proceedings.

Edited by
  • Formāts: PDF+DRM
  • Sērija : Lecture Notes in Computer Science 9168
  • Izdošanas datums: 17-Jul-2015
  • Izdevniecība: Springer International Publishing AG
  • Valoda: eng
  • ISBN-13: 9783319215006
  • Formāts - PDF+DRM
  • Cena: 53,52 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Ielikt grozā
  • Pievienot vēlmju sarakstam
  • Šī e-grāmata paredzēta tikai personīgai lietošanai. E-grāmatas nav iespējams atgriezt un nauda par iegādātajām e-grāmatām netiek atmaksāta.
  • Formāts: PDF+DRM
  • Sērija : Lecture Notes in Computer Science 9168
  • Izdošanas datums: 17-Jul-2015
  • Izdevniecība: Springer International Publishing AG
  • Valoda: eng
  • ISBN-13: 9783319215006

DRM restrictions

  • Kopēšana (kopēt/ievietot):

    nav atļauts

  • Drukāšana:

    nav atļauts

  • Lietošana:

    Digitālo tiesību pārvaldība (Digital Rights Management (DRM))
    Izdevējs ir piegādājis šo grāmatu šifrētā veidā, kas nozīmē, ka jums ir jāinstalē bezmaksas programmatūra, lai to atbloķētu un lasītu. Lai lasītu šo e-grāmatu, jums ir jāizveido Adobe ID. Vairāk informācijas šeit. E-grāmatu var lasīt un lejupielādēt līdz 6 ierīcēm (vienam lietotājam ar vienu un to pašu Adobe ID).

    Nepieciešamā programmatūra
    Lai lasītu šo e-grāmatu mobilajā ierīcē (tālrunī vai planšetdatorā), jums būs jāinstalē šī bezmaksas lietotne: PocketBook Reader (iOS / Android)

    Lai lejupielādētu un lasītu šo e-grāmatu datorā vai Mac datorā, jums ir nepieciešamid Adobe Digital Editions (šī ir bezmaksas lietotne, kas īpaši izstrādāta e-grāmatām. Tā nav tas pats, kas Adobe Reader, kas, iespējams, jau ir jūsu datorā.)

    Jūs nevarat lasīt šo e-grāmatu, izmantojot Amazon Kindle.

This book constitutes the proceedings of the 19th International Conference on Developments in Language Theory, DLT 2015, held in Liverpool, UK. The 31 papers presented together with 5 invited talks were carefully reviewed and selected from 54 submissions. Its scope is very general and includes, among others, the following topics and areas: combinatorial and algebraic properties of words and languages, grammars, acceptors and transducers for strings, trees, graphs, 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, cellular automata, bio-inspired computing, and quantum computing.
Recognisable Languages over Monads
1(13)
Mikolaj Bojanczyk
Garside and Quadratic Normalisation: A Survey
14(32)
Patrick Dehornoy
Grammar-Based Tree Compression
46(12)
Markus Lohrey
On Decidability of Intermediate Levels of Concatenation Hierarchies
58(13)
Jorge Almeida
Jana Bartonova
Ondrej Klima
Michal Kunc
Ergodic Infinite Permutations of Minimal Complexity
71(14)
Sergey V. Avgustinovich
Anna E. Frid
Svetlana Puzynina
Diverse Palindromic Factorization Is NP-complete
85(12)
Hideo Bannai
Travis Gagie
Shunsuke Inenaga
Juha Karkkainen
Dominik Kempa
Marcin Piatkowski
Simon J. Puglisi
Shiho Sugimoto
Factorization in Formal Languages
97(11)
Paul C. Bell
Daniel Reidenbach
Jeffrey Shallit
Consensus Game Acceptors
108(12)
Dietmar Berwanger
Marie van den Bogaard
On the Size of Two-Way Reasonable Automata for the Liveness Problem
120(12)
Maria Paola Bianchi
Juraj Hromkovic
Ivan Kovac
Squareable Words
132(11)
Francine Blanchet-Sadri
Abraham Rashin
Complexity Analysis: Transformation Monoids of Finite Automata
143(12)
Christian Brandi
Hans Ulrich Simon
Palindromic Complexity of Trees
155(12)
Srecko Brlek
Nadia Lafreniere
Xavier Provencal
Deciding Proper Conjugacy of Classes of One-Sided Finite-Type-Dyck Shifts
167(12)
Marie-Pierre Beai
Pavel Heller
Transfinite Lyndon Words
179(12)
Luc Boasson
Olivier Carton
Unary Patterns with Permutations
191(12)
James Currie
Florin Manea
Dirk Nowotka
Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change
203(12)
Christopher Czyba
Christopher Spinrath
Wolfgang Thomas
Enumeration Formula; in Neutral Sets
215(13)
Francesco Dolce
Dominique Perrin
On the Density of Context-Free and Counter Languages
228(12)
Joey Eremondi
Oscar H. Ibarra
Ian McQuillan
*-Continuous Kleene ω-Algebras
240(12)
Zoltan Esik
Uli Fahrenberg
Axel Legay
Unary Probabilistic and Quantum Automata on Promise Problems
252(12)
Aida Gainutdinova
Abuzer Yakaryilmaz
Generalizations of Code Languages with Marginal Errors
264(12)
Yo-Sub Han
Sang-Ki Ko
Kai Salomaa
Minimal Reversible Deterministic Finite Automata
276(12)
Markus Holzer
Sebastian Jakobi
Martin Kutrib
Multi-sequential Word Relations
288(12)
Ismael Jecker
Emmanuel Filiot
The Boundary of Prefix-Free Languages
300(13)
Jozef Jirasek
Galina Jiraskova
A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group
313(13)
Ines Klimann
Matthieu Picantin
Dmytro Savchuk
Path Checking for MTL and TPTL over Data Words
326(14)
Shiguang Feng
Markus Lohrey
Karin Quaas
On Distinguishing NC1 and NL
340(12)
Andreas Krebs
Klaus-Jorn Lange
Michael Ludwig
Surminimisation of Automata
352(12)
Victor Marsault
On the Complexity of fc-Piecewise Testability and the Depth of Automata
364(13)
Tomas Masopust
Michael Thomazo
Interval Exchange Words and the Question of Hof, Knill, and Simon
377(12)
Zuzana Masakova
Edita Pelantova
Stepan Starosta
State Complexity of Neighbourhoods and Approximate Pattern Matching
389(12)
Timothy Ng
David Rappaport
Kai Salomaa
Deterministic Ordered Restarting Automata that Compute Functions
401(12)
Friedrich Otto
Kent Kwee
Weight Assignment Logic
413(13)
Vitaly Ferevoshchikov
Complexity Bounds of Constant-Space Quantum Computation: (Extended Abstract)
426(13)
Tomoyuki Yamakami
Author Index 439