first
prev
toc
next
last
Download Citation
Recommend
Mark
Alert
Link
Print
DESCRIPTIONAL COMPLEXITY OF GENERALIZED FORBIDDING GRAMMARS
Authors:
Alexander Meduna a;
Martin 
vec a
vec a
| Affiliation: | a Brno University of Technology, Faculty of Information Technology, Department of Information Systems, Bo et chova 2, Brno 61266, Czech Republic. |
DOI:
10.1080/00207160304666
Publication Frequency:
12 issues per year
Published in:
International Journal of Computer Mathematics,
Volume
80,
Issue
1
January
2003
, pages 11
- 17
International Journal of Computer Mathematics,
Volume
80,
Issue
1
January
2003
, pages 11
- 17
Subjects:
Analysis - Mathematics;
Bioinformatics;
Computer Mathematics;
Discrete Mathematics;
Mathematical Finance;
Mathematical Logic;
Mathematical Numerical Analysis;
Systems & Computer Architecture;
Number of References: 12
Formats available:
PDF
(English)
Article Requests:
Order Reprints
:
Request Permissions
-
Single Article Purchase:
US$37.00
-
buy now
-
Sign In
- Online Sample
add to cart 
[ show other buying options ]
View Article:
View Article (PDF)
Abstract
This paper discusses the descriptional complexity of generalized forbidding grammars. It proves that every recursively enumerable language is generated by a generalized forbidding grammar containing no more than thirteen forbidding productions and no more than fifteen nonterminals.
|
| Keywords: Formal Language Theory; Descriptional Complexity; Forbidding Grammars |
| view references (12) |
|
Bookmark with:
|
CiteULike
Del.icio.us
BibSonomy
Connotea
More bookmarks
