Non-recursive Trade-offs between Two-Dimensional Automata and Grammars

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F14%3A00223264" target="_blank" >RIV/68407700:21230/14:00223264 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-09704-6_31" target="_blank" >http://dx.doi.org/10.1007/978-3-319-09704-6_31</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-09704-6_31" target="_blank" >10.1007/978-3-319-09704-6_31</a>

Result language
angličtina
Original language name
Non-recursive Trade-offs between Two-Dimensional Automata and Grammars
Original language description
We study succinctness of descriptional systems for picture languages. Basic models of two-dimensional finite automata and generalizations of context-free grammars are considered. It is shown t hat non-recursive trade-offs between the systems are very common. The results are based on the ability of th e systems to simulate Turing machines.
Czech name
—
Czech description
—

Project
<a href="/en/project/GAP103%2F10%2F0783" target="_blank" >GAP103/10/0783: Structure and its impact for recognition</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Article name in the collection
DCFS 2014: Proceedings of the 16th International Workshop on Descriptional Complexity of Formal Systems
ISBN
978-3-319-09703-9
ISSN
0302-9743
e-ISSN
—
Number of pages
12
Pages from-to
352-363
Publisher name
Springer
Place of publication
Berlin
Event location
Turku
Event date
Aug 5, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000343868700031

Similar results(10)