|
|
|
|
LEADER |
00000nam a22000005i 4500 |
001 |
978-3-642-39274-0 |
003 |
DE-He213 |
005 |
20230405233555.0 |
007 |
cr nn 008mamaa |
008 |
130711s2013 gw | s |||| 0|eng d |
020 |
|
|
|a 9783642392740
|9 978-3-642-39274-0
|
024 |
7 |
|
|a 10.1007/978-3-642-39274-0
|2 doi
|
050 |
|
4 |
|a QA75.5-76.95
|
072 |
|
7 |
|a UYA
|2 bicssc
|
072 |
|
7 |
|a COM037000
|2 bisacsh
|
072 |
|
7 |
|a UYA
|2 thema
|
082 |
0 |
4 |
|a 004.0151
|2 23
|
245 |
1 |
0 |
|a Implementation and Application of Automata
|h [electronic resource] :
|b 18th International Conference, CIAA 2013, Halifax, NS, Canada, July 16-19, 2013. Proceedings /
|c edited by Stavros Konstantinidis.
|
250 |
|
|
|a 1st ed. 2013.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2013.
|
300 |
|
|
|a XIV, 358 p. 78 illus.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 7982
|
505 |
0 |
|
|a 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.
|
520 |
|
|
|a This 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 |
|a Computer science.
|
650 |
|
0 |
|a Algorithms.
|
650 |
|
0 |
|a Machine theory.
|
650 |
|
0 |
|a Bioinformatics.
|
650 |
|
0 |
|a Artificial intelligence-Data processing.
|
650 |
|
0 |
|a Information storage and retrieval systems.
|
650 |
1 |
4 |
|a Theory of Computation.
|
650 |
2 |
4 |
|a Algorithms.
|
650 |
2 |
4 |
|a Formal Languages and Automata Theory.
|
650 |
2 |
4 |
|a Computational and Systems Biology.
|
650 |
2 |
4 |
|a Data Science.
|
650 |
2 |
4 |
|a Information Storage and Retrieval.
|
700 |
1 |
|
|a Konstantinidis, Stavros.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer Nature eBook
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642392757
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642392733
|
830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 7982
|
856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-642-39274-0
|z Texto Completo
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-SXCS
|
912 |
|
|
|a ZDB-2-LNC
|
950 |
|
|
|a Computer Science (SpringerNature-11645)
|
950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|