↓ 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 Complexity in Convex Languages
  3. Altmetric Badge
    Chapter 2 Three Learnable Models for the Description of Language
  4. Altmetric Badge
    Chapter 3 Arbology: Trees and Pushdown Automata
  5. Altmetric Badge
    Chapter 4 Analysis of Communicating Automata
  6. Altmetric Badge
    Chapter 5 Complexity of the Satisfiability Problem for a Class of Propositional Schemata
  7. Altmetric Badge
    Chapter 6 A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automaton
  8. Altmetric Badge
    Chapter 7 A Fast Longest Common Subsequence Algorithm for Similar Strings
  9. Altmetric Badge
    Chapter 8 Abelian Square-Free Partial Words
  10. Altmetric Badge
    Chapter 9 Avoidable Binary Patterns in Partial Words
  11. Altmetric Badge
    Chapter 10 Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata
  12. Altmetric Badge
    Chapter 11 Pregroup Grammars with Letter Promotions
  13. Altmetric Badge
    Chapter 12 A Hierarchical Classification of First-Order Recurrent Neural Networks
  14. Altmetric Badge
    Chapter 13 Choosing Word Occurrences for the Smallest Grammar Problem
  15. Altmetric Badge
    Chapter 14 Agreement and Cliticization in Italian: A Pregroup Analysis
  16. Altmetric Badge
    Chapter 15 Geometricity of Binary Regular Languages
  17. Altmetric Badge
    Chapter 16 On the Expressive Power of FO[ + ]
  18. Altmetric Badge
    Chapter 17 Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach
  19. Altmetric Badge
    Chapter 18 Operator Precedence and the Visibly Pushdown Property
  20. Altmetric Badge
    Chapter 19 On the Maximal Number of Cubic Runs in a String
  21. Altmetric Badge
    Chapter 20 On the Hamiltonian Operators for Adiabatic Quantum Reduction of SAT
  22. Altmetric Badge
    Chapter 21 Parametric Metric Interval Temporal Logic
  23. Altmetric Badge
    Chapter 22 Short Witnesses and Accepting Lassos in ω -Automata
  24. Altmetric Badge
    Chapter 23 Grammar-Based Compression in a Streaming Model
  25. Altmetric Badge
    Chapter 24 Simplifying Regular Expressions
  26. Altmetric Badge
    Chapter 25 A Programming Language Tailored to the Specification and Solution of Differential Equations Describing Processes on Networks
  27. Altmetric Badge
    Chapter 26 The Inclusion Problem for Regular Expressions
  28. Altmetric Badge
    Chapter 27 Learnability of Automatic Classes
  29. Altmetric Badge
    Chapter 28 Untestable Properties Expressible with Four First-Order Quantifiers
  30. Altmetric Badge
    Chapter 29 The Copying Power of Well-Nested Multiple Context-Free Grammars
  31. Altmetric Badge
    Chapter 30 Post Correspondence Problem with Partially Commutative Alphabets
  32. Altmetric Badge
    Chapter 31 Reversible Pushdown Automata
  33. Altmetric Badge
    Chapter 32 String Extension Learning Using Lattices
  34. Altmetric Badge
    Chapter 33 The Equivalence Problem of Deterministic Multitape Finite Automata: A New Proof of Solvability Using a Multidimensional Tape
  35. Altmetric Badge
    Chapter 34 Primitive Words Are Unavoidable for Context-Free Languages
  36. Altmetric Badge
    Chapter 35 Modal Nonassociative Lambek Calculus with Assumptions: Complexity and Context-Freeness
  37. Altmetric Badge
    Chapter 36 Hard Counting Problems for Partial Words
  38. Altmetric Badge
    Chapter 37 Exact Analysis of Horspool’s and Sunday’s Pattern Matching Algorithms with Probabilistic Arithmetic Automata
  39. Altmetric Badge
    Chapter 38 SA-REPC – Sequence Alignment with Regular Expression Path Constraint
  40. Altmetric Badge
    Chapter 39 CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages
  41. Altmetric Badge
    Chapter 40 A Boundary between Universality and Non-universality in Extended Spiking Neural P Systems
  42. Altmetric Badge
    Chapter 41 Using Sums-of-Products for Non-standard Reasoning
  43. Altmetric Badge
    Chapter 42 Restarting Automata with Structured Output and Functional Generative Description
  44. Altmetric Badge
    Chapter 43 A Randomized Numerical Aligner (rNA)
  45. Altmetric Badge
    Chapter 44 Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data
  46. Altmetric Badge
    Chapter 45 Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R)
  47. Altmetric Badge
    Chapter 46 Incremental Building in Peptide Computing to Solve Hamiltonian Path Problem
  48. Altmetric Badge
    Chapter 47 Variable Automata over Infinite Alphabets
  49. Altmetric Badge
    Chapter 48 Some Minimality Results on Biresidual and Biseparable Automata
  50. Altmetric Badge
    Chapter 49 Extending Stochastic Context-Free Grammars for an Application in Bioinformatics
  51. Altmetric Badge
    Chapter 50 Chomsky-Schützenberger-Type Characterization of Multiple Context-Free Languages
  52. Altmetric Badge
    Chapter 51 Complexity of Guided Insertion-Deletion in RNA-Editing
Attention for Chapter 1: Complexity in Convex Languages
Altmetric Badge

Citations

dimensions_citation
4 Dimensions

Readers on

mendeley
1 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
Complexity in Convex Languages
Chapter number 1
Book title
Language and Automata Theory and Applications
Published by
Springer, Berlin, Heidelberg, May 2010
DOI 10.1007/978-3-642-13089-2_1
Book ISBNs
978-3-64-213088-5, 978-3-64-213089-2
Authors

Janusz Brzozowski, Brzozowski, Janusz

View on publisher site
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 %
United States 1 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 100%
Readers by discipline Count As %
Computer Science 1 100%

This page is provided by Altmetric.