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

Language and Automata Theory and Applications

Overview of attention for book
Cover of 'Language and Automata Theory and Applications'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Non-Zero Sum Games for Reactive Synthesis
  3. Altmetric Badge
    Chapter 2 Tangles and Connectivity in Graphs
  4. Altmetric Badge
    Chapter 3 Restricted Turing Machines and Language Recognition
  5. Altmetric Badge
    Chapter 4 Automata for Ontologies
  6. Altmetric Badge
    Chapter 5 Reasoning with Prototypes in the Description Logic $${\mathcal {ALC}}$$ ALC Using Weighted Tree Automata
  7. Altmetric Badge
    Chapter 6 $$+\omega $$ + ω -Picture Languages Recognizable by Büchi-Tiling Systems
  8. Altmetric Badge
    Chapter 7 A Logical Characterization for Dense-Time Visibly Pushdown Automata
  9. Altmetric Badge
    Chapter 8 A Complexity Measure on Büchi Automata
  10. Altmetric Badge
    Chapter 9 Compositional Bisimulation Minimization for Interval Markov Decision Processes
  11. Altmetric Badge
    Chapter 10 A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot Theorem
  12. Altmetric Badge
    Chapter 11 Colored Nested Words
  13. Altmetric Badge
    Chapter 12 Input-Driven Queue Automata with Internal Transductions
  14. Altmetric Badge
    Chapter 13 Periodic Generalized Automata over the Reals
  15. Altmetric Badge
    Chapter 14 Minimal Separating Sequences for All Pairs of States
  16. Altmetric Badge
    Chapter 15 Forkable Regular Expressions
  17. Altmetric Badge
    Chapter 16 On the Levenshtein Automaton and the Size of the Neighbourhood of a Word
  18. Altmetric Badge
    Chapter 17 Parallelogram Morphisms and Circular Codes
  19. Altmetric Badge
    Chapter 18 On Del-Robust Primitive Partial Words with One Hole
  20. Altmetric Badge
    Chapter 19 Optimal Bounds for Computing $$\alpha $$ α -gapped Repeats
  21. Altmetric Badge
    Chapter 20 On XOR Lemma for Polynomial Threshold Weight and Length
  22. Altmetric Badge
    Chapter 21 The Beachcombers’ Problem: Walking and Searching from an Inner Point of a Line
  23. Altmetric Badge
    Chapter 22 Using Duality in Circuit Complexity
  24. Altmetric Badge
    Chapter 23 The Minimum Entropy Submodular Set Cover Problem
  25. Altmetric Badge
    Chapter 24 On the Capacity of Capacitated Automata
  26. Altmetric Badge
    Chapter 25 On Limited Nondeterminism and ACC Circuit Lower Bounds
  27. Altmetric Badge
    Chapter 26 The Complexity of Induced Tree Reconfiguration Problems
  28. Altmetric Badge
    Chapter 27 The Missing Case in Chomsky-Schützenberger Theorem
  29. Altmetric Badge
    Chapter 28 Homomorphic Characterizations of Indexed Languages
  30. Altmetric Badge
    Chapter 29 Ogden’s Lemma, Multiple Context-Free Grammars, and the Control Language Hierarchy
  31. Altmetric Badge
    Chapter 30 Steganography Based on Pattern Languages
  32. Altmetric Badge
    Chapter 31 Inferring a Relax NG Schema from XML Documents
  33. Altmetric Badge
    Chapter 32 Noise Free Multi-armed Bandit Game
  34. Altmetric Badge
    Chapter 33 Properties of Regular DAG Languages
  35. Altmetric Badge
    Chapter 34 Normal Form on Linear Tree-to-Word Transducers
  36. Altmetric Badge
    Chapter 35 A Kleene Theorem for Weighted Tree Automata over Tree Valuation Monoids
  37. Altmetric Badge
    Chapter 36 Hankel Matrices for Weighted Visibly Pushdown Automata
  38. Altmetric Badge
    Chapter 37 Linear Context-Free Tree Languages and Inverse Homomorphisms
  39. Altmetric Badge
    Chapter 38 Scalar Ambiguity and Freeness in Matrix Semigroups over Bounded Languages
  40. Altmetric Badge
    Chapter 39 The Word Problem for HNN-extensions of Free Inverse Semigroups
  41. Altmetric Badge
    Chapter 40 Between a Rock and a Hard Place – Uniform Parsing for Hyperedge Replacement DAG Grammars
  42. Altmetric Badge
    Chapter 41 An Error Correcting Parser for Context Free Grammars that Takes Less Than Cubic Time
  43. Altmetric Badge
    Chapter 42 Accurate Approximate Diagnosability of Stochastic Systems
  44. Altmetric Badge
    Chapter 43 Proof–Based Synthesis of Sorting Algorithms for Trees
  45. Altmetric Badge
    Chapter 44 Reversible Shrinking Two-Pushdown Automata
  46. Altmetric Badge
    Chapter 45 Reachability in Resource-Bounded Reaction Systems
  47. Altmetric Badge
    Chapter 46 Canonical Multi-target Toffoli Circuits
Attention for Chapter 14: Minimal Separating Sequences for All Pairs of States
Altmetric Badge

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
5 Mendeley
Summary Dimensions citations
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
Minimal Separating Sequences for All Pairs of States
Chapter number 14
Book title
Language and Automata Theory and Applications
Published in
Lecture notes in computer science, February 2016
DOI 10.1007/978-3-319-30000-9_14
Book ISBNs
978-3-31-929999-0, 978-3-31-930000-9
Authors

Rick Smetsers, Joshua Moerman, David N. Jansen, Smetsers, Rick, Moerman, Joshua, Jansen, David N.

View on publisher site
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Netherlands 1 20%
Unknown 4 80%

Demographic breakdown

Readers by professional status Count As %
Student > Master 3 60%
Researcher 1 20%
Student > Ph. D. Student 1 20%
Readers by discipline Count As %
Computer Science 5 100%

This page is provided by Altmetric.