Home Linguistics & Semiotics One-letter automata: How to reduce k tapes to one
Chapter
Licensed
Unlicensed Requires Authentication

One-letter automata: How to reduce k tapes to one

  • Hristo Ganchev , Stoyan Mihov and Klaus U. Schulz
Become an author with De Gruyter Brill
Explore this Subject How to publish with us
Logics for Linguistic Structures
This chapter is in the book Logics for Linguistic Structures

Chapters in this book

  1. Frontmatter I
  2. Contents V
  3. Introduction 1
  4. Type Theory with Records and unification-based grammar 9
  5. One-letter automata: How to reduce k tapes to one 35
  6. Two aspects of situated meaning 57
  7. Further excursions in natural logic: The Mid-Point Theorems 87
  8. On the logic of LGB type structures. Part I: Multidominance structures 105
  9. Completeness theorems for syllogistic fragments 143
  10. Backmatter 175
https://doi.org/10.1515/9783110211788.35

Chapters in this book

  1. Frontmatter I
  2. Contents V
  3. Introduction 1
  4. Type Theory with Records and unification-based grammar 9
  5. One-letter automata: How to reduce k tapes to one 35
  6. Two aspects of situated meaning 57
  7. Further excursions in natural logic: The Mid-Point Theorems 87
  8. On the logic of LGB type structures. Part I: Multidominance structures 105
  9. Completeness theorems for syllogistic fragments 143
  10. Backmatter 175
Sign up now to receive a 20% welcome discount
Institutional Access
How does access work?
Have an idea on how to improve our website?
Please write us.
© 2025 De Gruyter Brill
Downloaded on 3.10.2025 from https://www.degruyterbrill.com/document/doi/10.1515/9783110211788.35/html
Scroll to top button