000 03355nam a22006255i 4500
001 978-3-540-45526-4
003 DE-He213
005 20240423132456.0
007 cr nn 008mamaa
008 121227s2001 gw | s |||| 0|eng d
020 _a9783540455264
_9978-3-540-45526-4
024 7 _a10.1007/3-540-45526-4
_2doi
050 4 _aQA76.76.C65
072 7 _aUMC
_2bicssc
072 7 _aCOM010000
_2bisacsh
072 7 _aUMC
_2thema
082 0 4 _a005.45
_223
245 1 0 _aAutomata Implementation
_h[electronic resource] :
_b4th International Workshop on Implementing Automata, WIA'99 Potsdam, Germany, July 17-19, 2001 Revised Papers /
_cedited by Oliver Boldt, Helmut Jürgensen.
250 _a1st ed. 2001.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2001.
300 _aVII, 189 p.
_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,
_x1611-3349 ;
_v2214
505 0 _aFA 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 _aCompilers (Computer programs).
650 0 _aMathematical logic.
650 0 _aArtificial intelligence.
650 0 _aComputer science.
650 0 _aMachine theory.
650 0 _aPattern recognition systems.
650 1 4 _aCompilers and Interpreters.
650 2 4 _aMathematical Logic and Foundations.
650 2 4 _aArtificial Intelligence.
650 2 4 _aTheory of Computation.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aAutomated Pattern Recognition.
700 1 _aBoldt, Oliver.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aJürgensen, Helmut.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540428121
776 0 8 _iPrinted edition:
_z9783662197233
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2214
856 4 0 _uhttps://doi.org/10.1007/3-540-45526-4
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188161
_d188161