000 05435nam a22006615i 4500
001 978-3-540-48057-0
003 DE-He213
005 20240423132554.0
007 cr nn 008mamaa
008 121227s1999 gw | s |||| 0|eng d
020 _a9783540480570
_9978-3-540-48057-0
024 7 _a10.1007/3-540-48057-9
_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] :
_bThird International Workshop on Implementing Automata, WIA'98, Rouen, France, September 17-19, 1998, Revised Papers /
_cedited by Jean-Marc Champarnaud, Denis Maurel, Djelloul Ziadi.
250 _a1st ed. 1999.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1999.
300 _aX, 250 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 ;
_v1660
505 0 _aExtended Context-Free Grammars and Normal Form Algorithms -- On Parsing LL-Languages -- On Parsing and Condensing Substrings of LR Languages in Linear Time -- Minimal Cover-Automata for Finite Languages -- Determinization of Glushkov Automata -- Implementing Reversed Alternating Finite Automaton (r-AFA) Operations -- Operations on DASG -- Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching -- The Syntactic Prediction with Token Automata: Application to HandiAS System -- Bi-directional Automata to Extract Complex Phrases from Texts -- A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs -- Using Acceptors as Transducers -- Proving Sequential Function Chart Programs Using Automata -- Automata and Computational Probabilities -- Automata and Binary Decision Diagrams -- Operations over Automata with Multiplicities -- Paging Automata -- On the Syntax, Semantics, and Implementation of a Graph-Based Computational Environment -- The Finite State Automata’s Design Patterns -- Automata to Recognize Finite and Infinite Words with at Least Two Factorizations on a Given Finite Set -- Autographe: A Graphical Version of Automate -- INTEX 4.1 for Windows: A Walkthrough.
520 _aThe papers contained in this volume were presented at the third international Workshop on Implementing Automata, held September 17{19,1998, at the U- versity of Rouen, France. Automata theory is the cornerstone of computer science theory. While there is much practical experience with using automata, this work covers diverse - eas,includingparsing,computationallinguistics,speechrecognition,textsear- ing,device controllers,distributed systems, andprotocolanalysis.Consequently, techniques that have been discovered in one area may not be known in another. In addition, there is a growing number of symbolic manipulation environments designed to assist researchers in experimenting with and teaching on automata and their implementation; examples include FLAP, FADELA, AMORE, Fire- Lite, Automate, AGL, Turing’s World, FinITE, INR, and Grail. Developers of such systems have not had a forum in which to expose and compare their work. The purpose of this workshop was to bring together members of the academic, research,andindustrialcommunitieswithaninterestinimplementingautomata, to demonstrate their work and to explain the problems they have been solving. These workshops started in 1996 and 1997 at the University of Western Ontario, London, Ontario, Canada, prompted by Derick Wood and Sheng Yu. The major motivation for starting these workshops was that there had been no single forum in which automata-implementation issues had been discussed. The interest shown in the r st and second workshops demonstrated that there was a need for such a forum. The participation at the third workshop was very interesting: we counted sixty-three registrations, four continents, ten countries, twenty-three universities, and three companies.
650 0 _aArtificial intelligence.
650 0 _aMathematical logic.
650 0 _aCompilers (Computer programs).
650 0 _aComputer science.
650 0 _aMachine theory.
650 0 _aLogic design.
650 1 4 _aArtificial Intelligence.
650 2 4 _aMathematical Logic and Foundations.
650 2 4 _aCompilers and Interpreters.
650 2 4 _aTheory of Computation.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aLogic Design.
700 1 _aChamparnaud, Jean-Marc.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aMaurel, Denis.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aZiadi, Djelloul.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540666523
776 0 8 _iPrinted edition:
_z9783662194485
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1660
856 4 0 _uhttps://doi.org/10.1007/3-540-48057-9
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c189250
_d189250