↓ Skip to main content

CIAA 2003

Overview of attention for book
Cover of 'CIAA 2003'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Edit-Distance of Weighted Automata
  3. Altmetric Badge
    Chapter 2 p -Subsequentiable Transducers
  4. Altmetric Badge
    Chapter 3 Bidirectional Push Down Automata
  5. Altmetric Badge
    Chapter 4 Finite Automata and Non-self-Embedding Grammars
  6. Altmetric Badge
    Chapter 5 Simulation of Gate Circuits in the Algebra of Transients
  7. Altmetric Badge
    Chapter 6 The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata
  8. Altmetric Badge
    Chapter 7 Regex and Extended Regex
  9. Altmetric Badge
    Chapter 8 Prime Decompositions of Regular Prefix Codes
  10. Altmetric Badge
    Chapter 9 Implementation of Dictionaries via Automata and Decision Trees
  11. Altmetric Badge
    Chapter 10 Feedback-Free Circuits in the Algebra of Transients
  12. Altmetric Badge
    Chapter 11 On Minimizing Cover Automata for Finite Languages in O ( n log n ) Time
  13. Altmetric Badge
    Chapter 12 Compilation of Constraint-Based Contextual Rules for Part-of-Speech Tagging into Finite State Transducers
  14. Altmetric Badge
    Chapter 13 Finite State Lazy Operations in NLP
  15. Altmetric Badge
    Chapter 14 State Complexity of Basic Operations on Nondeterministic Finite Automata
  16. Altmetric Badge
    Chapter 15 Adaptive Automata - A Revisited Proposal
  17. Altmetric Badge
    Chapter 16 Efficient Automaton-Based Recognition for Linear Conjunctive Languages
  18. Altmetric Badge
    Chapter 17 Syntactic Semiring and Language Equations
  19. Altmetric Badge
    Chapter 18 Reduced Power Automata
  20. Altmetric Badge
    Chapter 19 A Polynomial Time Algorithm for Left [Right] Local Testability
  21. Altmetric Badge
    Chapter 20 Whale Calf, a Parser Generator for Conjunctive Grammars
  22. Altmetric Badge
    Chapter 21 automata, a Hybrid System for Computational Automata Theory
  23. Altmetric Badge
    Chapter 22 A Package TESTAS for Checking Some Kinds of Testability
  24. Altmetric Badge
    Chapter 23 DAWG versus Suffix Array
  25. Altmetric Badge
    Chapter 24 On Predictive Parsing and Extended Context-Free Grammars
  26. Altmetric Badge
    Chapter 25 Star Normal Form, Rational Expressions, and Glushkov WFAs Properties
  27. Altmetric Badge
    Chapter 26 Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings
  28. Altmetric Badge
    Chapter 27 Term Validation of Distributed Hard Real-Time Applications
  29. Altmetric Badge
    Chapter 28 Common Subsequence Automaton
  30. Altmetric Badge
    Chapter 29 Searching for Asymptotic Error Repair
  31. Altmetric Badge
    Chapter 30 Automata-Based Representations for Arithmetic Constraints in Automated Verification
  32. Altmetric Badge
    Chapter 31 On the Implementation of Compact DAWG’s
  33. Altmetric Badge
    Chapter 32 Dynamic Programming — NFA Simulation
  34. Altmetric Badge
    Chapter 33 Deterministic Parsing of Cyclic Strings
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
2 Wikipedia pages

Readers on

mendeley
4 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
CIAA 2003
Published by
Springer Science & Business Media, June 2003
DOI 10.1007/3-540-44977-9
ISBNs
978-3-54-040391-3, 978-3-54-044977-5
Editors

Champarnaud, Jean-Marc, Maurel, Denis

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 4 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 4 100%

Demographic breakdown

Readers by professional status Count As %
Student > Master 1 25%
Unknown 3 75%
Readers by discipline Count As %
Computer Science 1 25%
Unknown 3 75%