000 04544nam a22004575i 4500
999 _c200433882
_d52094
003 DE-He213
005 20231104114234.0
007 cr nn 008mamaa
008 150717s2015 gw | s |||| 0|eng d
020 _a9783319215006
_z978-3-319-21500-6
024 7 _a10.1007/978-3-319-21500-6
_2doi
040 _aTR-AnTOB
_beng
_cTR-AnTOB
_erda
050 4 _aQA75.5-76.95
072 7 _aUYZG
_2bicssc
072 7 _aCOM037000
_2bisacsh
072 7 _aUYZG
_2thema004.0151
_223
245 1 0 _aDevelopments in Language Theory :
_b19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015, Proceedings. /
_cedited by Igor Potapov.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2015.
300 _a1 online resource
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 0 _aTheoretical Computer Science and General Issues ;
_v9168
505 0 _aRecognisable Languages over Monads -- Garside and quadratic normalisation: a survey -- Grammar-Based Tree Compression -- On decidability of intermediate levels of concatenation hierarchies -- Ergodic in Finite permutations of minimal complexity -- Diverse Palindromic Factorization is NP-Complete -- Factorization in Formal Languages -- Consensus Game Acceptors -- On the Size of Two-Way Reasonable Automata for the Liveness Problem -- Squareable Words -- Complexity Analysis: Transformation Monoids of Finite Automata -- Palindromic complexity of trees -- Deciding proper conjugacy of classes of one-sided Finite-type-Dyck shifts -- Transfinite Lyndon words -- Unary patterns under permutations -- Finite Automata Over In Finite Alphabets: Two Models with Transitions for Local Change -- Enumeration formulin neutral sets -- On the Density of Context-Free and Counter Languages -- Star-Continuous Kleene Omega-Algebras -- Unary probabilistic and quantum automata on promise problems -- Generalizations of Code Languages with Marginal Errors -- Minimal Reversible Deterministic Finite Automata -- Multi-Sequential Word Relations -- The Boundary of Prefix-Free Languages -- A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group -- Path Checking for MTL and TPTL over Data Words -- On Distinguishing NC1 and NL -- Sur minimisation of automata -- On the Complexity of k-Piecewise Testability and the Depth of Automata -- Interval Exchange Words and the Question of Hof, Knill, and Simon -- State Complexity of Neighbourhoods and Approximate Pattern Matching -- Deterministic ordered restarting automata that compute functions -- Weight Assignment Logic -- Complexity Bounds of Constant-Space Quantum Computation.
520 _aThis 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.
650 0 _aComputer science.
650 0 _aComputer software.
650 0 _aComputational complexity.
650 1 4 _aComputation by Abstract Devices.
_0http://scigraph.springernature.com/things/product-market-codes/I16013
650 2 4 _aMathematical Logic and Formal Languages.
_0http://scigraph.springernature.com/things/product-market-codes/I16048
650 2 4 _aAlgorithm Analysis and Problem Complexity.
_0http://scigraph.springernature.com/things/product-market-codes/I16021
650 2 4 _aDiscrete Mathematics in Computer Science.
_0http://scigraph.springernature.com/things/product-market-codes/I17028
700 1 _aPotapov, Igor.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
856 4 0 _3Springer eBooks
_zOnline access link to the resource
_uhttps://doi.org/10.1007/978-3-319-21500-6
942 _2lcc
_cEBK
041 _aeng