000			03349nam a22005175i 4500
001			978-3-540-69205-8
003			DE-He213
005			20160624102055.0
007			cr nn 008mamaa
008			121227s1997 gw | s |||| 0|eng d
020			_a9783540692058 _9978-3-540-69205-8
024	7		_a10.1007/3-540-63174-7 _2doi
050		4	_aQA8.9-QA10.3
072		7	_aUYA _2bicssc
072		7	_aMAT018000 _2bisacsh
072		7	_aCOM051010 _2bisacsh
082	0	4	_a005.131 _223
245	1	0	_aAutomata Implementation _h[electronic resource] : _bFirst International Workshop on Implementing Automata, WIA '96 London, Ontario, Canada, August 29–31, 1996 Revised Papers / _cedited by Darrell Raymond, Derick Wood, Sheng Yu.
260		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1997.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1997.
300			_aVIII, 192 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, _x0302-9743 ; _v1260
505	0		_aWIA and the practice of theory in computer science -- Algorithms for guided tree automata -- Time series forecasting by finite-state automata -- Dynamical implementation of nondeterministic automata and concurrent systems -- Implementing WS1S via finite automata -- Instruction computation in subset construction -- Building automaton on schemata and acceptability tables -- FSA utilities: A toolbox to manipulate finite-state automata -- A new quadratic algorithm to convert a regular expression into an automaton -- Implementing sequential and parallel programs for the homing sequence problem -- Integrating hands-on work into the formal languages course via tools and programming -- NFA to DFA transformation for finite languages -- How to use sorting procedures to minimize DFA -- FIRE Lite: FAs and REs in C++.
520			_aThis book constitutes the strictly refereed post-workshop proceedings of the First International Workshop on Implementing Automata, WIA'96, held in London, Ontario, Canada, in August 1996. The volume presents 13 revised full papers together with an introduction and survey. The papers explore the use of software tools in formal language theory; various issues involved in the implementation of automata of all types are discussed. As the first book focusing on implementing automata, this collection of research papers defines the state of the art in the area. Generally speaking, the book advocates the practice of theory in computer science.
650		0	_aComputer science.
650		0	_aLogic design.
650	1	4	_aComputer Science.
650	2	4	_aMathematical Logic and Formal Languages.
650	2	4	_aLogics and Meanings of Programs.
650	2	4	_aComputation by Abstract Devices.
700	1		_aRaymond, Darrell. _eeditor.
700	1		_aWood, Derick. _eeditor.
700	1		_aYu, Sheng. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783540631743
786			_dSpringer
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v1260
856	4	0	_uhttp://dx.doi.org/10.1007/3-540-63174-7
942			_2EBK7168 _cEBK
999			_c36462 _d36462