About: Two-Way Linear PC Grammar Systems and Their Descriptional Complexity     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • 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 five components in a very economical way. Indeed, Γ's master has only three nonterminals and one communication production; furthermore, it produces all sentential foorms with no more than two occurrences of nonterminals. In addition, during every computation, Γ makes a single communication step.
  • 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 five components in a very economical way. Indeed, Γ's master has only three nonterminals and one communication production; furthermore, it produces all sentential foorms with no more than two occurrences of nonterminals. In addition, during every computation, Γ makes a single communication step. (en)
  • Kromě derivačních a komunikačních kroků dvousměrný PC gramatický systém vykonává také krok redukční, během kterého se nahrazuje pravá strana bezkontextového pravidla stranou levou. Článek dokazuje, že každý neunární rekurzivně spočetný jazyk může být popsán úsporným způsobem centralizovaným dvousměrným PC gramatickým systémem, Γ, s pěti komponentami. Přičemž hlavní komponenta obsahuje pouze tři nontermilány a jediné pravidlo obsahující komunikační symbol. Dále Γ během každého výpočtu pprovede jediný komunikační krok a všechny větné formy obsahují maximálně dva výskyty nonterminálních symbolů. (cs)
Title
  • Two-Way Linear PC Grammar Systems and Their Descriptional Complexity
  • Dvousměrné lineární PC gramatické systémy a jejich popisná složitost (cs)
  • Two-Way Linear PC Grammar Systems and Their Descriptional Complexity (en)
skos:prefLabel
  • Two-Way Linear PC Grammar Systems and Their Descriptional Complexity
  • Dvousměrné lineární PC gramatické systémy a jejich popisná složitost (cs)
  • Two-Way Linear PC Grammar Systems and Their Descriptional Complexity (en)
skos:notation
  • RIV/00216305:26230/05:PU56397!RIV06-GA0-26230___
http://linked.open.../vavai/riv/strany
  • 546-550
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA201/04/0441)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 547555
http://linked.open...ai/riv/idVysledku
  • RIV/00216305:26230/05:PU56397
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • 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)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [DCC2A32FA111]
http://linked.open...v/mistoKonaniAkce
  • Brno
http://linked.open...i/riv/mistoVydani
  • Brno
http://linked.open...i/riv/nazevZdroje
  • Proceedings of the 11th Conference Student EEICT 2005
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Kaláb, Petr
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • Vysoké učení technické v Brně. Nakladatelství VUTIUM
https://schema.org/isbn
  • 80-214-2890-2
http://localhost/t...ganizacniJednotka
  • 26230
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 35 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software