Clearing Restarting Automata

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F09%3A00206898" target="_blank" >RIV/00216208:11320/09:00206898 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Clearing Restarting Automata
Original language description
Restarting automata were introduced as a model for analysis by reduction which is a linguistically motivated method for checking correctness of a sentence. We propose a new restricted version of restarting automata called clearing restarting automata with a very simple definition but simultaneously with interesting properties with respect to their possible applications. The new model can be learned very efficiently from positive examples and its stronger version enables to learn effectively a large class of languages. We relate the class of languages recognized by clearing restarting automata to the Chomsky hierarchy.
Czech name
—
Czech description
—

Project
<a href="/en/project/1ET100300517" target="_blank" >1ET100300517: Methods for Intelligent Systems and Their Applications in Datamining and Natural Language Processing</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2009
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
Workshop on Non-Classical Models for Automata and Applications (NCMA)
ISBN
978-3-85403-256-4
ISSN
—
e-ISSN
—
Number of pages
14
Pages from-to
—
Publisher name
Österreichisches Computer Gesellschaft
Place of publication
Wien
Event location
Wien
Event date
Jan 1, 2009
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—

Similar results(10)