↓ 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 Context-Free Ambiguity Detection Using Multi-stack Pushdown Automata
  3. Altmetric Badge
    Chapter 2 Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets
  4. Altmetric Badge
    Chapter 4 A Perfect Class of Context-Sensitive Timed Languages
  5. Altmetric Badge
    Chapter 5 Position Automaton Construction for Regular Expressions with Intersection
  6. Altmetric Badge
    Chapter 6 A Language-Theoretical Approach to Descriptive Complexity
  7. Altmetric Badge
    Chapter 7 k-Abelian Equivalence and Rationality
  8. Altmetric Badge
    Chapter 8 Schützenberger Products in a Category
  9. Altmetric Badge
    Chapter 9 Outfix-Guided Insertion
  10. Altmetric Badge
    Chapter 10 Both Ways Rational Functions
  11. Altmetric Badge
    Chapter 11 Aperiodic String Transducers
  12. Altmetric Badge
    Chapter 12 An Automata Characterisation for Multiple Context-Free Languages
  13. Altmetric Badge
    Chapter 13 Weighted Automata and Logics on Infinite Graphs
  14. Altmetric Badge
    Chapter 14 Degrees of Infinite Words, Polynomials and Atoms
  15. Altmetric Badge
    Chapter 15 Ternary Square-Free Partial Words with Many Wildcards
  16. Altmetric Badge
    Chapter 16 Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space
  17. Altmetric Badge
    Chapter 17 Weighted Symbolic Automata with Data Storage
  18. Altmetric Badge
    Chapter 18 On Families of Full Trios Containing Counter Machine Languages
  19. Altmetric Badge
    Chapter 19 Non-regular Maximal Prefix-Free Subsets of Regular Languages
  20. Altmetric Badge
    Chapter 20 Operations on Unambiguous Finite Automata
  21. Altmetric Badge
    Chapter 21 The Trace Monoids in the Queue Monoid and in the Direct Product of Two Free Monoids
  22. Altmetric Badge
    Chapter 22 On Ordered RRWW-Automata
  23. Altmetric Badge
    Chapter 23 Developments in Language Theory
  24. Altmetric Badge
    Chapter 24 Compositions of Tree-to-Tree Statistical Machine Translation Models
  25. Altmetric Badge
    Chapter 25 On the Solvability Problem for Restricted Classes of Word Equations
  26. Altmetric Badge
    Chapter 26 Unambiguous Büchi Is Weak
  27. Altmetric Badge
    Chapter 27 One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations
  28. Altmetric Badge
    Chapter 28 Avoidability of Formulas with Two Variables
  29. Altmetric Badge
    Chapter 29 Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time
  30. Altmetric Badge
    Chapter 30 On Finite and Polynomial Ambiguity of Weighted Tree Automata
  31. Altmetric Badge
    Chapter 31 Developments in Language Theory
  32. Altmetric Badge
    Chapter 32 Monoid-Based Approach to the Inclusion Problem on Superdeterministic Pushdown Automata
Attention for Chapter 28: Avoidability of Formulas with Two Variables
Altmetric Badge

Mentioned by

wikipedia
1 Wikipedia page

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
Avoidability of Formulas with Two Variables
Chapter number 28
Book title
Developments in Language Theory
Published by
Springer, Berlin, Heidelberg, July 2016
DOI 10.1007/978-3-662-53132-7_28
Book ISBNs
978-3-66-253131-0, 978-3-66-253132-7
Authors

Pascal Ochem, Matthieu Rosenfeld, Ochem, Pascal, Rosenfeld, Matthieu

View on publisher site

Login to access the Attention Digest and the Sentiment Analysis related to this output.

Timeline Attention over time Attention Score history
Login to access the full charts related to this output.
Activity
Login to access the full charts related to this output.