Back to Search
Start Over
On the Generative Capacity of Context-Free Matrix Grammars over One-Letter Alphabet
- Source :
- Fundamenta Informaticae. 16:93-97
- Publication Year :
- 1992
- Publisher :
- IOS Press, 1992.
-
Abstract
- This note studies the conjecture that context-free matrix languages over one-letter alphabet are regular. We are able to confirm the conjecture in a special case where at most one non terminal can have an unbounded number of occurrences in sentential forms.
- Subjects :
- Algebra and Number Theory
business.industry
Computer science
Context (language use)
computer.software_genre
Theoretical Computer Science
Tree-adjoining grammar
Matrix (mathematics)
Computational Theory and Mathematics
Rule-based machine translation
Artificial intelligence
Alphabet
L-attributed grammar
business
computer
Generative grammar
Natural language processing
Information Systems
Subjects
Details
- ISSN :
- 18758681 and 01692968
- Volume :
- 16
- Database :
- OpenAIRE
- Journal :
- Fundamenta Informaticae
- Accession number :
- edsair.doi...........de264e591eb9f4fb93f007d3fdd369ca
- Full Text :
- https://doi.org/10.3233/fi-1992-16105