|
|
|
|
| LEADER |
03722nam a2200601 4500 |
| 001 |
978-3-540-45526-4 |
| 003 |
DE-He213 |
| 005 |
20191220125617.0 |
| 007 |
cr nn 008mamaa |
| 008 |
121227s2001 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540455264
|9 978-3-540-45526-4
|
| 024 |
7 |
|
|a 10.1007/3-540-45526-4
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.7-76.73
|
| 050 |
|
4 |
|a QA76.76.C65
|
| 072 |
|
7 |
|a UMX
|2 bicssc
|
| 072 |
|
7 |
|a COM051010
|2 bisacsh
|
| 072 |
|
7 |
|a UMX
|2 thema
|
| 072 |
|
7 |
|a UMC
|2 thema
|
| 082 |
0 |
4 |
|a 005.13
|2 23
|
| 245 |
1 |
0 |
|a Automata Implementation
|h [electronic resource] :
|b 4th International Workshop on Implementing Automata, WIA'99 Potsdam, Germany, July 17-19, 2001 Revised Papers /
|c edited by Oliver Boldt, Helmut Jürgensen.
|
| 250 |
|
|
|a 1st ed. 2001.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2001.
|
| 300 |
|
|
|a VII, 189 p.
|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 Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 2214
|
| 505 |
0 |
|
|a FA Minimisation Heuristics for a Class of Finite Languages -- SEA: A Symbolic Environment for Automata Theory -- Analysis of Reactive Systems with n Timers -- Animation of the Generation and Computation of Finite Automata for Learning Software -- Metric Lexical Analysis -- State Complexity of Basic Operations on Finite Languages -- Treatment of Unknown Words -- Computing Entropy Maps of Finite-Automaton-Encoded Binary Images -- Thompson Digraphs: A Characterization -- Finite Automata Encoding Geometric Figures -- Compressed Storage of Sparse Finite-State Transducers -- An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing -- Multiset Processing by Means of Systems of Finite State Transducers -- A Structural Method for Output Compaction of Sequential Automata Implemented as Circuits -- An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata -- A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Finite Automata.
|
| 650 |
|
0 |
|a Programming languages (Electronic computers).
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 650 |
|
0 |
|a Computers.
|
| 650 |
|
0 |
|a Pattern recognition.
|
| 650 |
1 |
4 |
|a Programming Languages, Compilers, Interpreters.
|0 http://scigraph.springernature.com/things/product-market-codes/I14037
|
| 650 |
2 |
4 |
|a Mathematical Logic and Foundations.
|0 http://scigraph.springernature.com/things/product-market-codes/M24005
|
| 650 |
2 |
4 |
|a Artificial Intelligence.
|0 http://scigraph.springernature.com/things/product-market-codes/I21000
|
| 650 |
2 |
4 |
|a Computation by Abstract Devices.
|0 http://scigraph.springernature.com/things/product-market-codes/I16013
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|0 http://scigraph.springernature.com/things/product-market-codes/I16048
|
| 650 |
2 |
4 |
|a Pattern Recognition.
|0 http://scigraph.springernature.com/things/product-market-codes/I2203X
|
| 700 |
1 |
|
|a Boldt, Oliver.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Jürgensen, Helmut.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783662197233
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540428121
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 2214
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-45526-4
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 912 |
|
|
|a ZDB-2-BAE
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
