000 05522nam a22005175i 4500
001 978-3-540-44674-3
003 DE-He213
005 20160624101951.0
007 cr nn 008mamaa
008 121227s2001 gw | s |||| 0|eng d
020 _a9783540446743
_9978-3-540-44674-3
024 7 _a10.1007/3-540-44674-5
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYZG
_2bicssc
072 7 _aCOM037000
_2bisacsh
082 0 4 _a004.0151
_223
245 1 0 _aImplementation and Application of Automata
_h[electronic resource] :
_b5th International Conference, CIAA 2000 London, Ontario, Canada, July 24–25, 2000 Revised Papers /
_cedited by Shen Yu, Andrei Păun.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2001.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2001.
300 _aXI, 342 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 ;
_v2088
505 0 _aInvited Lectures -- Synthesizing State-Based Object Systems from LSC Specifications -- Applications of Finite-State Transducers in Natural Language Processing -- Technical Contributions -- Fast Implementations of Automata Computations -- Regularly Extended Two-Way Nondeterministic Tree Automata -- Glushkov Construction for Multiplicities -- Implicit Structures to Implement NFA’s from Regular Expressions -- New Finite Automaton Constructions Based on Canonical Derivatives -- Experiments with Automata Compression -- Computing Raster Images from Grid Picture Grammars -- A Basis for Looping Extensions to Discriminating-Reverse Parsing -- Automata for Pro-V Topologies -- Reachability and Safety in Queue Systems -- Generalizing the Discrete Timed Automaton -- Factorization of Ambiguous Finite-State Transducers -- MONA Implementation Secrets -- Cursors -- An Automaton Model of User-Controlled Navigation on the Web -- Direct Construction of Minimal Acyclic Subsequential Transducers -- Generic ?-Removal Algorithm for Weighted Automata -- An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages -- Unary Language Concatenation and Its State Complexity -- Implementation of a Strategy Improvement Algorithm for Finite-State Parity Games -- State Complexity and Jacobsthal’s Function -- A Package for the Implementation of Block Codes as Finite Automata -- Regional Least-Cost Error Repair -- The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata -- Directly Constructing Minimal DFAs: Combining Two Algorithms by Brzozowski -- The MERLin Environment Applied to ?-NFAs -- Abstracts -- Visual Exploration of Generation Algorithms for Finite Automata on the Web -- TREEBAG -- Word Random Access Compression -- Extended Sequentialization of Transducers -- Lessons from INR in the Specification of Transductions -- Part-of-Speech Tagging with Two Sequential Transducers -- Solving Complex Problems Efficiently with Adaptive Automata.
520 _aThe Fifth International Conference on Implementation and Application of - tomata (CIAA 2000) was held at the University of Western Ontario in London, Ontario, Canada on July 24-25, 2000. This conference series was formerly called the International Workshop on Implementing Automata (WIA) This volume of the Lecture Notes in Computer Science series contains all the papers that were presented at CIAA 2000, and also the abstracts of the poster papers that were displayed during the conference. The conference addressed issues in automata application and implemen- tion. The topics of the papers presented at this conference ranged from automata applications in software engineering, natural language and speech recognition, and image processing, to new representations and algorithms for e cient imp- mentation of automata and related structures. Automata theory is one of the oldest areas in computer science. Research in automata theory has always been motivated by its applications since its early stages of development. In the 1960s and 1970s, automata research was moti- ted heavily by problems arising from compiler construction, circuit design, string matching, etc. In recent years, many new applications have been found in various areas of computer science as well as in other disciplines. Examples of the new applications include statecharts in object-oriented modeling, nite transducers in natural language processing, and nondeterministic nite-state models in c- munication protocols. Many of the new applications do not and cannot simply apply the existing models and algorithms in automata theory to their problems.
650 0 _aComputer science.
650 0 _aComputer software.
650 0 _aLogic design.
650 1 4 _aComputer Science.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aMathematical Logic and Formal Languages.
700 1 _aYu, Shen.
_eeditor.
700 1 _aPăun, Andrei.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540424918
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v2088
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-44674-5
942 _2EBK4952
_cEBK
999 _c34246
_d34246