Mixed computation: grammar up and down the Chomsky hierarchy
Proof-theoretic models of grammar are based on the view that an explicit characterization of a language comes in the form of the recursive enumeration of strings in that language. That recursive enumeration is carried out by a procedure which strongly generates a set of structural descriptions Σ and...
| Autor Principal: | |
|---|---|
| Formato: | Journal article |
| Idioma: | English |
| Publicado: |
John Benjamins Publishing Company
2021
|