↓ Skip to main content

Implementation and Application of Automata

Overview of attention for book
Cover of 'Implementation and Application of Automata'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Languages Recognizable by Quantum Finite Automata
  3. Altmetric Badge
    Chapter 2 The Language, the Expression, and the (Small) Automaton
  4. Altmetric Badge
    Chapter 3 Minimization of Non-deterministic Automata with Large Alphabets
  5. Altmetric Badge
    Chapter 4 Simulating Two-Dimensional Recognizability by Pushdown and Queue Automata
  6. Altmetric Badge
    Chapter 5 Component Composition Preserving Behavioural Contracts Based on Communication Traces
  7. Altmetric Badge
    Chapter 6 Strong Retiming Equivalence of Synchronous Schemes
  8. Altmetric Badge
    Chapter 7 Prime Normal Form and Equivalence of Simple Grammars
  9. Altmetric Badge
    Chapter 8 An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata
  10. Altmetric Badge
    Chapter 9 Finite Automata and Unions of Regular Patterns with Bounded Constant Segments
  11. Altmetric Badge
    Chapter 10 Inside Vaucanson
  12. Altmetric Badge
    Chapter 11 Deterministic Recognition of Trees Accepted by a Linear Pushdown Tree Automaton
  13. Altmetric Badge
    Chapter 12 Shorter Regular Expressions from Finite-State Automata
  14. Altmetric Badge
    Chapter 13 Wind in the Willows – Generating Music by Means of Tree Transducers
  15. Altmetric Badge
    Chapter 14 On Deterministic Catalytic Systems
  16. Altmetric Badge
    Chapter 15 Restricting the Use of Auxiliary Symbols for Restarting Automata
  17. Altmetric Badge
    Chapter 16 A Class of Rational n -WFSM Auto-intersections
  18. Altmetric Badge
    Chapter 17 Experiments with Deterministic ω -Automata for Formulas of Linear Temporal Logic
  19. Altmetric Badge
    Chapter 18 Computing Affine Hulls over ${\mathbb Q}$ and ${\mathbb Z}$ from Sets Represented by Number Decision Diagrams
  20. Altmetric Badge
    Chapter 19 Tree Automata and XPath on Compressed Trees
  21. Altmetric Badge
    Chapter 20 Deeper Connections Between LTL and Alternating Automata
  22. Altmetric Badge
    Chapter 21 The Structure of Subword Graphs and Suffix Trees of Fibonacci Words
  23. Altmetric Badge
    Chapter 22 Observations on Determinization of Büchi Automata
  24. Altmetric Badge
    Chapter 23 The Interval Rank of Monotonic Automata
  25. Altmetric Badge
    Chapter 24 Compressing XML Documents Using Recursive Finite State Automata
  26. Altmetric Badge
    Chapter 25 Non-backtracking Top-Down Algorithm for Checking Tree Automata Containment
  27. Altmetric Badge
    Chapter 26 Size Reduction of Multitape Automata
  28. Altmetric Badge
    Chapter 27 Robust Spelling Correction
  29. Altmetric Badge
    Chapter 28 On Two-Dimensional Pattern Matching by Finite Automata
  30. Altmetric Badge
    Chapter 29 Incremental and Semi-incremental Construction of Pseudo-Minimal Automata
  31. Altmetric Badge
    Chapter 30 Is Learning RFSAs Better Than Learning DFAs?
  32. Altmetric Badge
    Chapter 31 Learning Stochastic Finite Automata for Musical Style Recognition
  33. Altmetric Badge
    Chapter 32 Simulation of Soliton Circuits
  34. Altmetric Badge
    Chapter 33 Acyclic Automata with Easy-to-Find Short Regular Expressions
  35. Altmetric Badge
    Chapter 34 On the Equivalence Problem for Programs with Mode Switching
  36. Altmetric Badge
    Chapter 35 Automata and AB-Categorial Grammars
  37. Altmetric Badge
    Chapter 36 On a Class of Bijective Binary Transducers with Finitary Description Despite Infinite State Set
Attention for Chapter 30: Is Learning RFSAs Better Than Learning DFAs?
Altmetric Badge

Readers on

mendeley
1 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.
Chapter title
Is Learning RFSAs Better Than Learning DFAs?
Chapter number 30
Book title
Implementation and Application of Automata
Published by
Springer, Berlin, Heidelberg, June 2005
DOI 10.1007/11605157_30
Book ISBNs
978-3-54-031023-5, 978-3-54-033097-4
Authors

Pedro García, José Ruiz, Antonio Cano, Gloria Alvarez, García, Pedro, Ruiz, José, Cano, Antonio, Alvarez, Gloria

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Researcher 1 100%
Student > Doctoral Student 1 100%
Readers by discipline Count As %
Mathematics 1 100%
Computer Science 1 100%