"A Two-Way PC Grammar Systems Based on Regular Grammars"@en . "A Two-Way PC Grammar Systems Based on Regular Grammars" . . "Vysok\u00E9 u\u010Den\u00ED technick\u00E9 v Brn\u011B. Fakulta informa\u010Dn\u00EDch technologi\u00ED" . . . . . . . "Kal\u00E1b, Petr" . . "5"^^ . "252-256" . "RIV/00216305:26230/04:PU49114!RIV06-GA0-26230___" . "Dvousm\u011Brn\u00E9 PC gramatick\u00E9 syst\u00E9my zalo\u017Een\u00E9 na regul\u00E1rn\u00EDch gramatik\u00E1ch"@cs . "RIV/00216305:26230/04:PU49114" . "80-214-2635-7" . "1"^^ . "Brno" . "P(GA201/04/0441)" . "Brno" . "1"^^ . . . "Krom\u011B deriva\u010Dn\u00EDch a komunika\u010Dn\u00EDch krok\u016F m\u016F\u017Ee dvousm\u011Brn\u00FD PC gramatick\u00FD syst\u00E9m vykon\u00E1vat kroky reduk\u010Dn\u00ED b\u011Bhem nich\u017E nahrad\u00ED pravou stranu bezkontextov\u00E9ho pravidla stranou levou. \u010Cl\u00E1nek dokazuje, \u017Ee ka\u017Ed\u00FD neun\u00E1rn\u00ED rekurzivn\u011B spo\u010Detn\u00FD jazyk je definov\u00E1n \u00FAsporn\u00FDm zp\u016Fsobem pomoc\u00ED centralizovan\u00E9ho dvousm\u011Brn\u00E9ho PC gramatick\u00E9ho syst\u00E9mu, Γ, kter\u00FD m\u00E1 t\u0159i komponenty. Hlavn\u00ED komponenta obsahuje pouze t\u0159i nontermin\u00E1ly a jedin\u00E9 praviddlo obsahuj\u00EDc\u00ED komunika\u010Dn\u00ED symbol; d\u00E1le v\u0161echny generovan\u00E9 v\u011Btn\u00E9 formy neobssahuj\u00ED v\u00EDce ne\u017E dva v\u00FDskyty nontermin\u00E1ln\u00EDch symbol\u016F. B\u011Bhem ka\u017Ed\u00E9ho v\u00FDpo\u010Dtu provede Γ jedin\u00FD komunika\u010Dn\u00ED krok. Na z\u00E1v\u011Br \u010Dl\u00E1nku jsou diskutov\u00E1ny n\u011Bkter\u00E9 varianty t\u011Bchto syst\u00E9m\u016F."@cs . . . "553253" . . . . "A Two-Way PC Grammar Systems Based on Regular Grammars" . "Besides derivation and communication steps, a two-way PC grammar system can make a reduction step during which it reduces the right-hand side of a context-free production to its left hand-side. This paper proves that every non-unary recursively enumerable language is defined by a centralized two-way grammar system, Γ, with three components in a very economical way. Indeed, Γ?s master has only three nonterminals and one communication production; furthermore, it produces all sentential fforms with no more than two occurrences of nonterminals. In addition, during every computation, Γ makes a single communication step. Some variants of two-way PC grammar system are discussed in the conclusion of this paper." . "[16AD0FCA17A9]" . . . "Proceedings of 10th Conference and Competition STUDENT EEICT 2004" . . "Dvousm\u011Brn\u00E9 PC gramatick\u00E9 syst\u00E9my zalo\u017Een\u00E9 na regul\u00E1rn\u00EDch gramatik\u00E1ch"@cs . "Context-free grammar, left-linear grammar, right-linear grammar, grammar system, communication step, two-way PC grammar systems, derivation, production, sentential form, nonterminal, terminal"@en . . "A Two-Way PC Grammar Systems Based on Regular Grammars"@en . "Besides derivation and communication steps, a two-way PC grammar system can make a reduction step during which it reduces the right-hand side of a context-free production to its left hand-side. This paper proves that every non-unary recursively enumerable language is defined by a centralized two-way grammar system, Γ, with three components in a very economical way. Indeed, Γ?s master has only three nonterminals and one communication production; furthermore, it produces all sentential fforms with no more than two occurrences of nonterminals. In addition, during every computation, Γ makes a single communication step. Some variants of two-way PC grammar system are discussed in the conclusion of this paper."@en . . . . "2004-04-29+02:00"^^ . "26230" . . .