Please use this identifier to cite or link to this item: doi:10.22028/D291-26467
Title: Iterative monoide
Author(s): Marzinkewitsch, Reiner
Language: English
Year of Publication: 1985
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: This paper introduces the notion of iterative monoides, which are an algebraic description of the structure of formal languages. By proving some invariants concerning structure- preserving mappings we justify this definition. Especially we exhibit, that a language´s iterative monoides and those of its image under canonical homomorphism as subset of the language´s syntactical monoid are closely related. Furthermore we try to obtain fineteness-conditions for some classes of formal languages (regular languages, Dyck- languages, bracketed c.f. languages, c.f. languages) by taking advantage of the new concepts.
Link to this record: urn:nbn:de:bsz:291-scidok-51646
Series name: Technischer Bericht / A / Fachbereich Informatik, Universität des Saarlandes
Series volume: 1985/18
Date of registration: 4-Apr-2013
Faculty: MI - Fakultät für Mathematik und Informatik
Department: MI - Informatik
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
fb14_1985_18.pdf17,58 MBAdobe PDFView/Open

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.