Skip to main content
Journal Article

Normal forms of grammars, finite automata, abstract families, and closure properties of multiset languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2235 135-146
DOI: 10.1007/3-540-45523-x_8
7Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We investigate closure properties of multiset languages, defined by multiset grammars. To this aim, this abstract families of multiset languages are considered, as well as several normal forms for multiset grammars. Furthermore, a new definition of deterministic finite multiset automata is proposed. © 2001 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Kudlek, M., & Mitrana, V. (2001). Normal forms of grammars, finite automata, abstract families, and closure properties of multiset languages. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2235, 135–146. https://doi.org/10.1007/3-540-45523-x_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free