↓ Skip to main content
What is this page? Embed badge

Implementation and Applications of Automata

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity
  3. Altmetric Badge
    Chapter 2 Language Decompositions, Primality, and Trajectory-Based Operations
  4. Altmetric Badge
    Chapter 3 Automata, Probability, and Recursion
  5. Altmetric Badge
    Chapter 4 Concurrency, Synchronization, and Conflicts in Petri Nets
  6. Altmetric Badge
    Chapter 5 Automated Compositional Reasoning of Intuitionistically Closed Regular Properties
  7. Altmetric Badge
    Chapter 6 Antimirov and Mosses’s Rewrite System Revisited
  8. Altmetric Badge
    Chapter 7 Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
  9. Altmetric Badge
    Chapter 8 Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref ( L )
  10. Altmetric Badge
    Chapter 9 Hopcroft’s Minimization Technique: Queues or Stacks?
  11. Altmetric Badge
    Chapter 10 Learning Regular Languages Using Nondeterministic Finite Automata
  12. Altmetric Badge
    Chapter 11 Multi-Return Macro Tree Transducers
  13. Altmetric Badge
    Chapter 12 Computing Convex Hulls by Automata Iteration
  14. Altmetric Badge
    Chapter 13 A Translation from the HTML DTD into a Regular Hedge Grammar
  15. Altmetric Badge
    Chapter 14 Tree-Series-to-Tree-Series Transformations
  16. Altmetric Badge
    Chapter 15 Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning
  17. Altmetric Badge
    Chapter 16 Pattern Matching in DCA Coded Text
  18. Altmetric Badge
    Chapter 17 Five Determinisation Algorithms
  19. Altmetric Badge
    Chapter 18 Persistent Computations of Turing Machines
  20. Altmetric Badge
    Chapter 19 On Complexity of Two Dimensional Languages Generated by Transducers
  21. Altmetric Badge
    Chapter 20 Games for Temporal Logics on Trees
  22. Altmetric Badge
    Chapter 21 A Run-Time Efficient Implementation of Compressed Pattern Matching Automata
  23. Altmetric Badge
    Chapter 22 Composed Bisimulation for Tree Automata
  24. Altmetric Badge
    Chapter 23 Hyper-Minimization in O ( n 2 )
  25. Altmetric Badge
    Chapter 24 Deterministic Pushdown Automata and Unary Languages
  26. Altmetric Badge
    Chapter 25 Finite Eilenberg Machines
  27. Altmetric Badge
    Chapter 26 The Number of Runs in Sturmian Words
  28. Altmetric Badge
    Chapter 27 3-Way Composition of Weighted Finite-State Transducers
  29. Altmetric Badge
    Chapter 28 Progressive Solutions to FSM Equations
  30. Altmetric Badge
    Chapter 29 Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees
  31. Altmetric Badge
    Chapter 30 Approximate Periods with Levenshtein Distance
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
3 X users

Readers on

mendeley
1 Mendeley
Summary X
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
Implementation and Applications of Automata
Published by
Springer Berlin Heidelberg, July 2008
DOI 10.1007/978-3-540-70844-5
ISBNs
978-3-54-070843-8, 978-3-54-070844-5
Editors

Ibarra, Oscar H., Ravikumar, Bala

View on publisher site
X Demographics

X Demographics

The data shown below were collected from the profiles of 3 X users 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 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 %
Professor 1 100%
Student > Ph. D. Student 1 100%
Readers by discipline Count As %
Computer Science 2 200%

This page is provided by Altmetric.