On vector languages

Authors:
A. B. Cremers;O. Mayer
Affiliations:
-;-
Venue:
Journal of Computer and System Sciences
Year:
1974

Citing 3
Cited 1

On Context-Free Languages

Journal of the ACM (JACM)
Programmed Grammars and Classes of Formal Languages

Journal of the ACM (JACM)
The Mathematical Theory of Context-Free Languages

The Mathematical Theory of Context-Free Languages

On the computational complexity of dominance links in grammatical formalisms

ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The family of vector languages properly contains all context-free languages. For vector languages the emptiness and finiteness problems are proved to be decidable. The Parikh mapping of a vector language is shown to be semilinear.