Publication detail
Context-Free Derivations on Word Monoids
MEDUNA, A.
Original Title
Context-Free Derivations on Word Monoids
Type
journal article - other
Language
English
Original Abstract
It shown that using generators of the length at most two, context sensitive and recursively enumerable languages can be characterized in a natural manner.
Keywords
word monoids, finite languages, context-free grammars, context sensitive languages, recursively enumerable languages
Authors
MEDUNA, A.
Released
1. 1. 1990
Publisher
Springer Verlag
Location
Heidelberg
ISBN
0001-5903
Periodical
Acta Informatica
Year of study
1990
Number
27
State
Federal Republic of Germany
Pages from
781
Pages to
786
Pages count
6
BibTex
@article{BUT191816,
author="Alexandr {Meduna}",
title="Context-Free Derivations on Word Monoids",
journal="Acta Informatica",
year="1990",
volume="1990",
number="27",
pages="781--786",
issn="0001-5903"
}