Implementation and Application of Automata : 7th International Conference, CIAA 2002, Tours, France, July 3-5, 2002, Revised Papers

Corporate Author: SpringerLink (Online service)
Other Authors: Champarnaud, Jean-Marc (Editor), Maurel, Denis (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2003, 2003
Edition:1st ed. 2003
Series:Lecture Notes in Computer Science
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
LEADER 03347nmm a2200385 u 4500
001 EB000656126
003 EBX01000000000000000509208
005 00000000000000.0
007 cr|||||||||||||||||||||
008 140122 ||| eng
020 |a 9783540449775 
100 1 |a Champarnaud, Jean-Marc  |e [editor] 
245 0 0 |a Implementation and Application of Automata  |h Elektronische Ressource  |b 7th International Conference, CIAA 2002, Tours, France, July 3-5, 2002, Revised Papers  |c edited by Jean-Marc Champarnaud, Denis Maurel 
250 |a 1st ed. 2003 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2003, 2003 
300 |a XI, 310 p  |b online resource 
505 0 |a Invited Lecture -- Edit-Distance of Weighted Automata -- Technical Contributions -- p-Subsequentiable Transducers -- Bidirectional Push Down Automata -- Finite Automata and Non-self-Embedding Grammars -- Simulation of Gate Circuits in the Algebra of Transients -- The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata -- Regex and Extended Regex -- Prime Decompositions of Regular Prefix Codes -- Implementation of Dictionaries via Automata and Decision Trees -- Feedback-Free Circuits in the Algebra of Transients -- On Minimizing Cover Automata for Finite Languages in O(n log n) Time -- Compilation of Constraint-Based Contextual Rules for Part-of-Speech Tagging into Finite State Transducers -- Finite State Lazy Operations in NLP -- State Complexity of Basic Operations on Nondeterministic Finite Automata -- Adaptive Automata - A Revisited Proposal -- Efficient Automaton-Based Recognition for Linear Conjunctive Languages -- Syntactic Semiring and Language Equations -- Reduced Power Automata -- A Polynomial Time Algorithm for Left [Right] Local Testability -- Whale Calf, a Parser Generator for Conjunctive Grammars -- automata, a Hybrid System for Computational Automata Theory -- A Package TESTAS for Checking Some Kinds of Testability -- DAWG versus Suffix Array -- On Predictive Parsing and Extended Context-Free Grammars -- Star Normal Form, Rational Expressions, and Glushkov WFAs Properties -- Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings -- Term Validation of Distributed Hard Real-Time Applications -- Common Subsequence Automaton -- Searching for Asymptotic Error Repair -- Abstracts -- Automata-Based Representations for Arithmetic Constraints in Automated Verification -- On the Implementation of Compact DAWG’s -- Dynamic Programming — NFA Simulation -- Deterministic Parsing of Cyclic Strings 
653 |a Computation by Abstract Devices 
653 |a Mathematical Logic and Formal Languages 
653 |a Mathematical logic 
653 |a Algorithms 
653 |a Computers 
653 |a Artificial Intelligence 
653 |a Artificial intelligence 
653 |a Algorithm Analysis and Problem Complexity 
653 |a Logics and Meanings of Programs 
653 |a Computer logic 
700 1 |a Maurel, Denis  |e [editor] 
710 2 |a SpringerLink (Online service) 
041 0 7 |a eng  |2 ISO 639-2 
989 |b SBA  |a Springer Book Archives -2004 
490 0 |a Lecture Notes in Computer Science 
856 |u https://doi.org/10.1007/3-540-44977-9?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 006.3