Attributes | Values |
---|
rdf:type
| |
Description
| - V článeku jsou vylepšeny dva výsledky týkající se popisné složitosti gramatik regulovaných kontextovými podmínkami. Konkrétněji, je ukázáno, že každý rekurzívně spočetný jazyk je generován zobecněnou zakazující gramatikou stupně dva s nejvýše osmi podmínkovými pravidly a deseti neterminály, nebo prostou polopodmínkovou gramatikou stupně (2,1) s nejvýše devíti podmínkovými pravidly a deseti neterminály. (cs)
- This paper improves some well-known results concerning the descriptional complexity of grammars regulated by context conditions. Specifically, it proves that every recursively enumerable language is generated by a generalized forbidding grammar of degree two with no more than eight conditional productions and ten nonterminals, or by a simple semi-conditional grammar of degree (2,1) with no more than nine conditional productions and ten nonterminals.
- This paper improves some well-known results concerning the descriptional complexity of grammars regulated by context conditions. Specifically, it proves that every recursively enumerable language is generated by a generalized forbidding grammar of degree two with no more than eight conditional productions and ten nonterminals, or by a simple semi-conditional grammar of degree (2,1) with no more than nine conditional productions and ten nonterminals. (en)
|
Title
| - An Improvement of the Descriptional Complexity of Grammars Regulated by Context Conditions
- An Improvement of the Descriptional Complexity of Grammars Regulated by Context Conditions (en)
- Vylepšení popisné složitosti gramatik regulovaných kontextovými podmínkami (cs)
|
skos:prefLabel
| - An Improvement of the Descriptional Complexity of Grammars Regulated by Context Conditions
- An Improvement of the Descriptional Complexity of Grammars Regulated by Context Conditions (en)
- Vylepšení popisné složitosti gramatik regulovaných kontextovými podmínkami (cs)
|
skos:notation
| - RIV/00216305:26230/06:PU67018!RIV07-GA0-26230___
|
http://linked.open.../vavai/riv/strany
| |
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| |
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
| |
http://linked.open...ai/riv/idVysledku
| - RIV/00216305:26230/06:PU67018
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - descriptional complexity, generalized forbidding grammar, simple semi-conditional grammar<br> (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...v/mistoKonaniAkce
| |
http://linked.open...i/riv/mistoVydani
| |
http://linked.open...i/riv/nazevZdroje
| - Second Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2006)
|
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
| |
http://linked.open...vavai/riv/typAkce
| |
http://linked.open.../riv/zahajeniAkce
| |
number of pages
| |
http://purl.org/ne...btex#hasPublisher
| |
https://schema.org/isbn
| |
http://localhost/t...ganizacniJednotka
| |
is http://linked.open...avai/riv/vysledek
of | |