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

Developments in Language Theory

Overview of attention for book
Cover of 'Developments in Language Theory'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Reaction Systems: A Model of Computation Inspired by Biochemistry
  3. Altmetric Badge
    Chapter 2 A Brief Excursion Inside the Class of Tiling Recognizable Two-Dimensional Languages
  4. Altmetric Badge
    Chapter 3 The Complexity of Regular(-Like) Expressions
  5. Altmetric Badge
    Chapter 4 On Decision Problems for Simple and Parameterized Machines
  6. Altmetric Badge
    Chapter 5 DNA Computing and Its Implications for Theoretical Computer Science
  7. Altmetric Badge
    Chapter 6 Numeration Systems: A Link between Number Theory and Formal Language Theory
  8. Altmetric Badge
    Chapter 7 Algorithmic Properties of Millstream Systems
  9. Altmetric Badge
    Chapter 8 On a Conjecture by Carpi and D’Alessandro
  10. Altmetric Badge
    Chapter 9 Linking Algebraic Observational Equivalence and Bisimulation
  11. Altmetric Badge
    Chapter 10 Undecidability and Hierarchy Results for Parallel Communicating Finite Automata
  12. Altmetric Badge
    Chapter 11 Inclusion Problems for Patterns with a Bounded Number of Variables
  13. Altmetric Badge
    Chapter 12 On the Average Number of States of Partial Derivative Automata
  14. Altmetric Badge
    Chapter 13 On the Hybrid Černý-Road Coloring Problem and Hamiltonian Paths
  15. Altmetric Badge
    Chapter 14 Computing Blocker Sets for the Regular Post Embedding Problem
  16. Altmetric Badge
    Chapter 15 Rankers over Infinite Words
  17. Altmetric Badge
    Chapter 16 Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices
  18. Altmetric Badge
    Chapter 17 On Müller Context-Free Grammars
  19. Altmetric Badge
    Chapter 18 Minimization of Deterministic Bottom-Up Tree Transducers
  20. Altmetric Badge
    Chapter 19 Two-Way Unary Automata versus Logarithmic Space
  21. Altmetric Badge
    Chapter 20 On the Periodicity of Morphic Words
  22. Altmetric Badge
    Chapter 21 Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups
  23. Altmetric Badge
    Chapter 22 Using Light to Implement Parallel Boolean Algebra
  24. Altmetric Badge
    Chapter 23 Periodicity in Tilings
  25. Altmetric Badge
    Chapter 24 Complexity in Union-Free Regular Languages
  26. Altmetric Badge
    Chapter 25 Schema for Parallel Insertion and Deletion
  27. Altmetric Badge
    Chapter 26 On Schützenberger Products of Semirings
  28. Altmetric Badge
    Chapter 27 On Language Equations XXK  =  XXL and XM  =  N over a Unary Alphabet
  29. Altmetric Badge
    Chapter 28 Around Dot Depth Two
  30. Altmetric Badge
    Chapter 29 Input Products for Weighted Extended Top-Down Tree Transducers
  31. Altmetric Badge
    Chapter 30 Regular Hedge Language Factorization Revisited
  32. Altmetric Badge
    Chapter 31 Fast Parsing for Boolean Grammars: A Generalization of Valiant’s Algorithm
  33. Altmetric Badge
    Chapter 32 On Lexicalized Well-Behaved Restarting Automata That Are Monotone
  34. Altmetric Badge
    Chapter 33 On a Powerful Class of Non-universal P Systems with Active Membranes
  35. Altmetric Badge
    Chapter 34 State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages
  36. Altmetric Badge
    Chapter 35 Restricted Ambiguity of Erasing Morphisms
  37. Altmetric Badge
    Chapter 36 Automata with Extremal Minimality Conditions
  38. Altmetric Badge
    Chapter 37 On the Existence of Minimal β -Powers
  39. Altmetric Badge
    Chapter 38 The Averaging Trick and the Černý Conjecture
  40. Altmetric Badge
    Chapter 39 Pseudo-power Avoidance
  41. Altmetric Badge
    Chapter 40 On Restricted Context-Free Grammars
  42. Altmetric Badge
    Chapter 41 Developments in Language Theory
  43. Altmetric Badge
    Chapter 42 On the Iterated Hairpin Completion
  44. Altmetric Badge
    Chapter 43 On Lookahead Hierarchies for Monotone and Deterministic Restarting Automata with Auxiliary Symbols (Extended Abstract)
  45. Altmetric Badge
    Chapter 44 Joint Topologies for Finite and Infinite Words
Attention for Chapter 31: Fast Parsing for Boolean Grammars: A Generalization of Valiant’s Algorithm
Altmetric Badge

Mentioned by

twitter
1 X user

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
3 Mendeley
Summary X 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
Fast Parsing for Boolean Grammars: A Generalization of Valiant’s Algorithm
Chapter number 31
Book title
Developments in Language Theory
Published by
Springer, Berlin, Heidelberg, August 2010
DOI 10.1007/978-3-642-14455-4_31
Book ISBNs
978-3-64-214454-7, 978-3-64-214455-4
Authors

Alexander Okhotin, Okhotin, Alexander

View on publisher site
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 3 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
United States 1 33%
Unknown 2 67%

Demographic breakdown

Readers by professional status Count As %
Professor 1 33%
Student > Ph. D. Student 1 33%
Researcher 1 33%
Readers by discipline Count As %
Computer Science 2 67%
Mathematics 1 33%

This page is provided by Altmetric.