Descriptional Complexity of Generalized Forbidding Grammars
From International Center for Computational Logic
Descriptional Complexity of Generalized Forbidding Grammars
Tomáš MasopustTomáš Masopust, Alexander MedunaAlexander Meduna
Tomáš Masopust, Alexander Meduna
Descriptional Complexity of Generalized Forbidding Grammars
Proc. of 9th International Workshop on Descriptional Complexity of Formal Systems (DCFS), 170-177, 2007
Descriptional Complexity of Generalized Forbidding Grammars
Proc. of 9th International Workshop on Descriptional Complexity of Formal Systems (DCFS), 170-177, 2007
- KurzfassungAbstract
This paper discusses the descriptional complexity of generalized forbidding grammars in context of degrees, numbers of nonterminals and conditional productions, and a new descriptional complexity measure—an index—of generalized forbidding grammars. - Forschungsgruppe:Research Group: Wissensbasierte SystemeKnowledge-Based Systems
@inproceedings{MM2007,
author = {Tom{\'{a}}{\v{s}} Masopust and Alexander Meduna},
title = {Descriptional Complexity of Generalized Forbidding Grammars},
booktitle = {Proc. of 9th International Workshop on Descriptional Complexity
of Formal Systems (DCFS)},
year = {2007},
pages = {170-177}
}