000 03788nam a22006015i 4500
001 978-3-319-15579-1
003 DE-He213
005 20200421111837.0
007 cr nn 008mamaa
008 150223s2015 gw | s |||| 0|eng d
020 _a9783319155791
_9978-3-319-15579-1
024 7 _a10.1007/978-3-319-15579-1
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYZG
_2bicssc
072 7 _aCOM037000
_2bisacsh
082 0 4 _a004.0151
_223
245 1 0 _aLanguage and Automata Theory and Applications
_h[electronic resource] :
_b9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings /
_cedited by Adrian-Horia Dediu, Enrico Formenti, Carlos Mart�in-Vide, Bianca Truthe.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2015.
300 _aXV, 754 p. 140 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8977
505 0 _aAlgorithms -- Automata, Logic, and Concurrency -- Codes, Semigroups, and Symbolic Dynamics -- Combinatorics on Words -- Complexity and Recursive Functions -- Compression, Inference, Pattern Matching, and Model Checking -- Graphs, Term Rewriting, and Networks -- Transducers, Tree Automata, and Weighted Automata.
520 _aThis book constitutes the refereed proceedings of the 9th International Conference on Language and Automata Theory and Applications, LATA 2015, held in Nice, France in March 2015. The 53 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 115 submissions. The papers cover the following topics: algebraic language theory; algorithms for semi-structured data mining, algorithms on automata and words; automata and logic; automata for system analysis and program verification; automata networks, concurrency and Petri nets; automatic structures; cellular automata, codes, combinatorics on words; computational complexity; data and image compression; descriptional complexity; digital libraries and document engineering; foundations of finite state technology; foundations of XML; fuzzy and rough languages; grammatical inference and algorithmic learning; graphs and graph transformation; language varieties and semigroups; parallel and regulated rewriting; parsing; patterns; string and combinatorial issues in computational biology and bioinformatics; string processing algorithms; symbolic dynamics; term rewriting; transducers; trees, tree languages and tree automata; weighted automata.
650 0 _aComputer science.
650 0 _aComputers.
650 0 _aAlgorithms.
650 0 _aMathematical logic.
650 0 _aComputer science
_xMathematics.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aSymbolic and Algebraic Manipulation.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aArtificial Intelligence (incl. Robotics).
700 1 _aDediu, Adrian-Horia.
_eeditor.
700 1 _aFormenti, Enrico.
_eeditor.
700 1 _aMart�in-Vide, Carlos.
_eeditor.
700 1 _aTruthe, Bianca.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783319155784
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8977
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-319-15579-1
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c55318
_d55318