About: Tree-controlled Grammars with Restrictions Placed upon Cuts and Paths     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
rdfs:seeAlso
Description
  • First, this paper discusses tree-controlled grammars with root-to-leaf derivation-tree paths restricted by control languages. It demonstrates that if the control languages are regular, these grammars generate the family of context-free languages. Then, in a similar way, the paper introduces tree-controlled grammars with derivation-tree cuts restricted by control languages. It proves that if the cuts are restricted by regular languages, these grammars generate the family of recursively enumerable languages. In addition, it places a binary-relation-based restriction upon these grammars and demonstrate that this adi- tional restriction does not affect the generative power of these grammars.
  • First, this paper discusses tree-controlled grammars with root-to-leaf derivation-tree paths restricted by control languages. It demonstrates that if the control languages are regular, these grammars generate the family of context-free languages. Then, in a similar way, the paper introduces tree-controlled grammars with derivation-tree cuts restricted by control languages. It proves that if the cuts are restricted by regular languages, these grammars generate the family of recursively enumerable languages. In addition, it places a binary-relation-based restriction upon these grammars and demonstrate that this adi- tional restriction does not affect the generative power of these grammars. (en)
Title
  • Tree-controlled Grammars with Restrictions Placed upon Cuts and Paths
  • Tree-controlled Grammars with Restrictions Placed upon Cuts and Paths (en)
skos:prefLabel
  • Tree-controlled Grammars with Restrictions Placed upon Cuts and Paths
  • Tree-controlled Grammars with Restrictions Placed upon Cuts and Paths (en)
skos:notation
  • RIV/00216305:26230/12:PU98152!RIV13-GA0-26230___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GD102/09/H042), P(MEB041003), S, Z(MSM0021630528)
http://linked.open...iv/cisloPeriodika
  • 1
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
  • 175059
http://linked.open...ai/riv/idVysledku
  • RIV/00216305:26230/12:PU98152
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • context-free grammars, tree-controlled grammars, restricted derivation trees, paths, cuts, language families  (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • CZ - Česká republika
http://linked.open...ontrolniKodProRIV
  • [38FE8D9F02A3]
http://linked.open...i/riv/nazevZdroje
  • Kybernetika
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...v/svazekPeriodika
  • 48
http://linked.open...iv/tvurceVysledku
  • Meduna, Alexandr
  • Koutný, Jiří
http://linked.open...n/vavai/riv/zamer
issn
  • 0023-5954
number of pages
http://localhost/t...ganizacniJednotka
  • 26230
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