000 04095nam a22006015i 4500
001 978-3-540-69104-4
003 DE-He213
005 20240423132504.0
007 cr nn 008mamaa
008 121227s1998 gw | s |||| 0|eng d
020 _a9783540691044
_9978-3-540-69104-4
024 7 _a10.1007/BFb0031375
_2doi
050 4 _aQ334-342
050 4 _aTA347.A78
072 7 _aUYQ
_2bicssc
072 7 _aCOM004000
_2bisacsh
072 7 _aUYQ
_2thema
082 0 4 _a006.3
_223
245 1 0 _aAutomata Implementation
_h[electronic resource] :
_bSecond International Workshop on Implementing Automata, WIA'97, London, Ontario, Canada, September 18-20, 1997, Revised Papers /
_cedited by Derick Wood, Sheng Yu.
250 _a1st ed. 1998.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1998.
300 _aIX, 259 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 ;
_v1436
505 0 _aWIA and theory and practice -- Construction of efficient generalized LR parsers -- Visualization of dynamic automata using Padnon -- Automata of asynchronous behaviors -- LANGAGE: A Maple package for automaton characterization of regular languages -- In vitro implementation of finite-state machines -- Implementing WS1S via finite automata: Performance issues -- Multi-tape automata for speech and language systems: A prolog implementation -- Tools to implement automata, a first step: ASTL -- Minimal separating sets for Muller automata -- Pseudo-minimal transducers: A transducer with proper elements -- Towards a meta-normal form algorithm for context-free grammars -- A rational design for a weighted finite-state transducer library -- An efficient null-free procedure for deciding regular language membership -- Operations on extended automata -- Efficient implementation of regular languages using r-AFA -- INTEX: An integrated FST toolbox -- Precise estimation of the order of local testability of a deterministic finite automaton -- Teaching theory of computation with tape machines -- The automata theory package omega -- Practical optimizations for automata -- Sorting and doubling techniques for set partitioning and automata minimization problems.
520 _aThis book constitutes the thoroughly refereed revised post-workshop proceedings of the Second International Workshop on Implementing Automata, WIA'97, held in London, Ontario, Canada, in September 1997. The book presents 21 revised full papers carefully reviewed and selected for inclusion in the book; also included is an introductory overview. The papers discuss issues involved in the implementation of automata of all types also covering aspects from areas such as natural language processing, pattern matching, speaker recognition, VLSI testing, etc. This book reflects the state-of-the-art in this emerging area of interdisciplinary research.
650 0 _aArtificial intelligence.
650 0 _aComputer science.
650 0 _aMachine theory.
650 0 _aPattern recognition systems.
650 1 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 _aWood, Derick.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aYu, Sheng.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540646945
776 0 8 _iPrinted edition:
_z9783662195192
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1436
856 4 0 _uhttps://doi.org/10.1007/BFb0031375
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188309
_d188309