000 | 03343nam a22005535i 4500 | ||
---|---|---|---|
001 | 978-3-642-39274-0 | ||
003 | DE-He213 | ||
005 | 20160624102230.0 | ||
007 | cr nn 008mamaa | ||
008 | 130711s2013 gw | s |||| 0|eng d | ||
020 |
_a9783642392740 _9978-3-642-39274-0 |
||
024 | 7 |
_a10.1007/978-3-642-39274-0 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUYZG _2bicssc |
|
072 | 7 |
_aCOM037000 _2bisacsh |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aImplementation and Application of Automata _h[electronic resource] : _b18th International Conference, CIAA 2013, Halifax, NS, Canada, July 16-19, 2013. Proceedings / _cedited by Stavros Konstantinidis. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2013. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2013. |
|
300 |
_aXIV, 358 p. 78 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 ; _v7982 |
|
505 | 0 | _aComplexity of automata -- Compressed automata -- Counter automata -- Dictionary matching -- Edit distance -- Homing sequences -- Implementation -- Minimization of automata -- Model checking -- Parsing of regular expressions -- Partial word automata -- Picture languages -- Pushdown automata -- Queue automata -- Reachability analysis for software verification -- Restarting automata -- Transducers -- Tree automata -- Weighted automata -- XML streams. | |
520 | _aThis book constitutes the thoroughly refereed papers of the 18th International Conference on Implementation and Application of Automata, CIAA 2013, held in Halifax, NS, Canada, in July 2013. The 25 revised full papers presented together with 3 invited papers and 7 short papers were carefully selected from 43 submissions. The papers cover various topics such as complexity of automata; compressed automata; counter automata; dictionary matching; edit distance; homing sequences; implementation; minimization of automata; model checking; parsing of regular expressions; partial word automata; picture languages; pushdown automata; queue automata; reachability analysis for software verification; restarting automata; transducers; tree automata; weighted automata; XML streams. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aData structures (Computer science). | |
650 | 0 | _aComputer software. | |
650 | 0 | _aInformation storage and retrieval systems. | |
650 | 0 | _aBioinformatics. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aComputation by Abstract Devices. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
650 | 2 | 4 | _aComputational Biology/Bioinformatics. |
650 | 2 | 4 | _aData Structures. |
650 | 2 | 4 | _aInformation Storage and Retrieval. |
700 | 1 |
_aKonstantinidis, Stavros. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783642392733 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v7982 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-642-39274-0 |
942 |
_2EBK10953 _cEBK |
||
999 |
_c40247 _d40247 |