Complexity of Two-Dimensional Rank-Reducing Grammars
The result's identifiers
Result code in 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>
Result on the web
<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>
Alternative languages
Result language
angličtina
Original language name
Complexity of Two-Dimensional Rank-Reducing Grammars
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA19-21198S" target="_blank" >GA19-21198S: Complex prediction models and their learning from weakly annotated data</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
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
Number of pages
12
Pages from-to
155-166
Publisher name
Springer, Cham
Place of publication
—
Event location
Vienna
Event date
Aug 24, 2020
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—