Complexity of Two-Dimensional Rank-Reducing Grammars

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F20%3A00345996" target="_blank" >RIV/68407700:21230/20:00345996 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1007/978-3-030-62536-8_13" target="_blank" >https://doi.org/10.1007/978-3-030-62536-8_13</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-62536-8_13" target="_blank" >10.1007/978-3-030-62536-8_13</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Complexity of Two-Dimensional Rank-Reducing Grammars

Popis výsledku v původním jazyce

We study properties of a two-dimensional grammar introduced recently for use in document analysis and recognition. The grammar is obtained from the two-dimensional context-free grammar by restricting the form of productions. Variants (ranks) of the grammar with regard to productions complexity are defined. It is suggested that the lowest-rank variant can be considered as a natural generalization of the regular matrix grammar, which in addition has good properties with respect to the membership and emptiness problems. However, it is also showed that the higher-rank variants do not loosen complexity of the context-free grammar too much. There is a conditional lower bound preventing to propose a linear-time parsing algorithm. Moreover, the grammar is able to simulate the 2-counter Minsky machine, which results in non-recursive trade-offs and undecidability of the emptiness problem.

Název v anglickém jazyce

Complexity of Two-Dimensional Rank-Reducing Grammars

Popis výsledku anglicky

We study properties of a two-dimensional grammar introduced recently for use in document analysis and recognition. The grammar is obtained from the two-dimensional context-free grammar by restricting the form of productions. Variants (ranks) of the grammar with regard to productions complexity are defined. It is suggested that the lowest-rank variant can be considered as a natural generalization of the regular matrix grammar, which in addition has good properties with respect to the membership and emptiness problems. However, it is also showed that the higher-rank variants do not loosen complexity of the context-free grammar too much. There is a conditional lower bound preventing to propose a linear-time parsing algorithm. Moreover, the grammar is able to simulate the 2-counter Minsky machine, which results in non-recursive trade-offs and undecidability of the emptiness problem.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GA19-21198S" target="_blank" >GA19-21198S: Složité predikční modely a jejich učení z částečně anotovaných dat</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2020

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

22nd International Conference, DCFS 2020, Vienna, Austria, August 24–26, 2020, Proceedings

ISBN

978-3-030-62535-1

ISSN

0302-9743

e-ISSN

1611-3349

Počet stran výsledku

12

Strana od-do

155-166

Název nakladatele

Springer, Cham

Místo vydání

—

Místo konání akce

Vienna

Datum konání akce

24. 8. 2020

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—