このページのリンク

引用にはこちらのURLをご利用ください

利用統計

  • このページへのアクセス:17回

  • 貸出数:0回
    (1年以内の貸出数:0回)

<図書>
Implementation and application of automata : 5th International Conference, CIAA 2000, London, Ontario, Canada, July 24-25, 2000 : revised papers

責任表示 Sheng Yu, Andrei Păun (eds.)
シリーズ Lecture notes in computer science ; 2088
データ種別 図書
出版情報 Berlin ; Tokyo : Springer , c2001
本文言語 英語
大きさ xi, 342 p. ; ill. ; 24 cm
目次 Machine generated contents note: Invited Lectures
Synthesizing State-Based Object Systems from LSC Specifications 1
David Harel, Hillel Kugler
Applications of Finite-State Transducers in Natural Language Processing 34
Lauri Karttunen
Technical Contributions
Fast Implementations of Automata Computations 47
Anne Bergeron, Sylvie Hamel
Regularly Extended Two-Way Nondeterministic Tree Automata 57
Anne Briiggemann-Klein, Derick Wood
Glushkov Construction for Multiplicities 67
Pascal Caron, Marianne Flouret
Implicit Structures to Implement NFA's from Regular Expressions 80
Jean-Marc Champarnaud
New Finite Automaton Constructions Based on Canonical Derivatives 94
Jean-Marc Champarnaud, D. Ziadi
Experiments with Automata Compression 105
Jan Daciuk
Computing Raster Images from Grid Picture Grammars 113
Frank Drewes, Sigrid Ewert, Renate Klempien-Hinrichs,
Hans-Jorg Kreowski
A Basis for Looping Extensions to Discriminating-Reverse Parsing 122
Jacques Farre, Jose Fortes Gdlvez
Automata for Pro-V Topologies 135
Pierre-Cyrille Heam
Reachability and Safety in Queue Systems 145
Oscar H. Ibarra
Generalizing the Discrete Timed Automaton 157
Oscar H. Ibarra, Jianwen Su
Factorization of Ambiguous Finite-State Transducers 170
Andre Kempe
MONA Implementation Secrets 182
Nils Klarlund, Anders M0ller, Michael I. Schwartzbach
Cursors 195
Vincent Le Maout
An Automaton Model of User-Controlled Navigation on the Web 208
K. Lodaya, R. Ramanujam
Direct Construction of Minimal Acyclic Subsequential Transducers 217
Stoyan Mihov, Denis Maurel
Generic e-Removal Algorithm for Weighted Automata 230
Mehryar Mohri
An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite
Languages 243
Andrei Paun, Nicolae Sdntean, Sheng Yu
Unary Language Concatenation and Its State Complexity 252
Giovanni Pighizzini
Implementation of a Strategy Improvement Algorithm for Finite-State Parity Games 263
Dominik Schmitz, Jens Voge
State Complexity and Jacobsthal's Function 272
Jeffrey Shallit
A Package for the Implementation of Block Codes as Finite Automata 279
Priti Shankar, K. Sasidharan, Vikas Aggarwal, B. Sundar Rajan
Regional Least-Cost Error Repair 293
M. Vilares, V.M. Darriba, F.J. Ribadas
The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata 302
H. Todd Wareham
Directly Constructing Minimal DFAs: Combining Two Algorithms by Brzozowski 311
Bruce W. Watson
The MERLin Environment Applied to *-NFAs 318
Lynette van Zijl, John-Paul Harper, Frank Olivier
Abstracts
Visual Exploration of Generation Algorithms for Finite Automata
on the Web 327
Stephan Diehl, Andreas Kerren, Torsten Weller
TREEBAG 329
Frank Drewes, Renate Klempien-Hinrichs
Word Random Access Compression 331
Jir' Dvorsky, Vclav Sndsel
Extended Sequentialization of Transducers 333
Tamds Gadl
Lessons from INR in the Specification of Transductions 335
J. Howard Johnson
Part-of-Speech Tagging with Two Sequential Transducers 337
Andre Kempe
Solving Complex Problems Efficiently with Adaptive Automata340
Jodo Jose Neto
Author Index 343.
続きを見る
電子版へのリンク

所蔵情報



理系図 自動書庫 408/L 49 2001
061232004025132

書誌詳細

一般注記 Includes bibliographical references and index
著者標目 *International Conference on Implementation and Application of Automata (5th : 2000 : London, Ontario, Canada)
Yü, Sheng
Păun, Andrei
件 名 LCSH:Mathine theory -- Congresses  全ての件名で検索
分 類 LCC:QA267
書誌ID 1001010760
ISBN 3540424911
NCID BA53277913
巻冊次 ISBN:3540424911
登録日 2009.09.16
更新日 2017.02.18

類似資料