Detail publikace
How to Generate Recursively Enumerable Languages Using Only Context-free Productions and Eight Nonterminals
BIDLO, R., BLATNÝ, P.
Originální název
How to Generate Recursively Enumerable Languages Using Only Context-free Productions and Eight Nonterminals
Anglický název
How to Generate Recursively Enumerable Languages Using Only Context-free Productions and Eight Nonterminals
Jazyk
en
Originální abstrakt
The notion of a context-free grammar over a free group is introduced. The transformation of any type-0 grammar to an equivalent context-free grammar over a free group is demonstrated. This approach causes an undesirable increase of the number of nonterminal symbols. Hence we introduce a method for their reduction.
Anglický abstrakt
The notion of a context-free grammar over a free group is introduced. The transformation of any type-0 grammar to an equivalent context-free grammar over a free group is demonstrated. This approach causes an undesirable increase of the number of nonterminal symbols. Hence we introduce a method for their reduction.
Dokumenty
BibTex
@inproceedings{BUT18908,
author="Radek {Bidlo} and Petr {Blatný}",
title="How to Generate Recursively Enumerable Languages Using Only Context-free Productions and Eight Nonterminals",
annote="The notion of a context-free grammar over a free group is introduced.
The transformation of any type-0 grammar to an equivalent context-free
grammar over a free group is demonstrated. This approach causes an
undesirable increase of the number of nonterminal symbols. Hence we
introduce a method for their reduction.",
address="Faculty of Electrical Engineering and Communication BUT",
booktitle="Proceedings of 11th Conference and Competition Student EEICT 2005, Volume 3",
chapter="18908",
institution="Faculty of Electrical Engineering and Communication BUT",
year="2005",
month="may",
pages="536--541",
publisher="Faculty of Electrical Engineering and Communication BUT",
type="conference paper"
}