↓ 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 Implementation and Application of Automata in String Processing
  3. Altmetric Badge
    Chapter 2 Applications of Automata in XML Processing
  4. Altmetric Badge
    Chapter 3 Program Analysis through Finite Tree Automata
  5. Altmetric Badge
    Chapter 4 An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton
  6. Altmetric Badge
    Chapter 5 On Extremal Cases of Hopcroft’s Algorithm
  7. Altmetric Badge
    Chapter 6 Compact Normal Form for Regular Languages as Xor Automata
  8. Altmetric Badge
    Chapter 7 Cellular Automata with Sparse Communication
  9. Altmetric Badge
    Chapter 8 A Cellular Automaton Model for Car Traffic with a Slow-to-Stop Rule
  10. Altmetric Badge
    Chapter 9 On Parallel Implementations of Deterministic Finite Automata
  11. Altmetric Badge
    Chapter 10 FAdo and GUItar: Tools for Automata Manipulation and Visualization
  12. Altmetric Badge
    Chapter 11 A Testing Framework for Finite-State Morphology
  13. Altmetric Badge
    Chapter 12 A Table Compression Method for Extended Aho-Corasick Automaton
  14. Altmetric Badge
    Chapter 13 Compact Representation for Answer Sets of n-ary Regular Queries
  15. Altmetric Badge
    Chapter 14 Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata
  16. Altmetric Badge
    Chapter 15 Random Generation of Deterministic Tree (Walking) Automata
  17. Altmetric Badge
    Chapter 16 Hedge Pattern Partial Derivative
  18. Altmetric Badge
    Chapter 17 TAGED Approximations for Temporal Properties Model-Checking
  19. Altmetric Badge
    Chapter 18 Verifying Parallel Programs with Dynamic Communication Structures
  20. Altmetric Badge
    Chapter 19 Fixpoint Guided Abstraction Refinement for Alternating Automata
  21. Altmetric Badge
    Chapter 20 Automata-Based Termination Proofs
  22. Altmetric Badge
    Chapter 21 Implementation of State Elimination Using Heuristics
  23. Altmetric Badge
    Chapter 22 Short Regular Expressions from Finite Automata: Empirical Results
  24. Altmetric Badge
    Chapter 23 Small Extended Expressions for Acyclic Automata
  25. Altmetric Badge
    Chapter 24 Quantum Queries on Permutations with a Promise
  26. Altmetric Badge
    Chapter 25 Time-Optimal Winning Strategies for Poset Games
  27. Altmetric Badge
    Chapter 26 Amount of Nonconstructivity in Finite Automata
  28. Altmetric Badge
    Chapter 27 Multiflex: A Multilingual Finite-State Tool for Multi-Word Units
  29. Altmetric Badge
    Chapter 28 Efficient Parsing Using Filtered-Popping Recursive Transition Networks
  30. Altmetric Badge
    Chapter 29 Forest FIRE: A Taxonomy-based Toolkit of Tree Automata and Regular Tree Algorithms
  31. Altmetric Badge
    Chapter 30 Implementation and Application of Automata
  32. Altmetric Badge
    Chapter 31 Compiler Generator Based on Restarting Automata
  33. Altmetric Badge
    Chapter 32 Are Statecharts Finite Automata?
Attention for Chapter 6: Compact Normal Form for Regular Languages as Xor Automata
Altmetric Badge

Mentioned by

twitter
1 X user

Readers on

mendeley
2 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
Compact Normal Form for Regular Languages as Xor Automata
Chapter number 6
Book title
Implementation and Application of Automata
Published in
Lecture notes in computer science, July 2009
DOI 10.1007/978-3-642-02979-0_6
Book ISBNs
978-3-64-202978-3, 978-3-64-202979-0
Authors

Jean Vuillemin, Nicolas Gama

X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Student > Master 2 100%
Readers by discipline Count As %
Mathematics 1 50%
Computer Science 1 50%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 1. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 06 March 2014.
All research outputs
#18,366,246
of 22,747,498 outputs
Outputs from Lecture notes in computer science
#6,007
of 8,126 outputs
Outputs of similar age
#101,228
of 109,978 outputs
Outputs of similar age from Lecture notes in computer science
#29
of 37 outputs
Altmetric has tracked 22,747,498 research outputs across all sources so far. This one is in the 11th percentile – i.e., 11% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,126 research outputs from this source. They receive a mean Attention Score of 5.0. This one is in the 14th percentile – i.e., 14% of its peers scored the same or lower than it.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 109,978 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 3rd percentile – i.e., 3% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 37 others from the same source and published within six weeks on either side of this one. This one is in the 5th percentile – i.e., 5% of its contemporaries scored the same or lower than it.