On localization of (post)prefix (in)consistencies

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10131373" target="_blank" >RIV/00216208:11320/12:10131373 - isvavai.cz</a>

Result on the web

<a href="http://ksvi.mff.cuni.cz/workshop/theorietag2012/files/ProcTt12final_v2opt.pdf" target="_blank" >http://ksvi.mff.cuni.cz/workshop/theorietag2012/files/ProcTt12final_v2opt.pdf</a>

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

On localization of (post)prefix (in)consistencies

Original language description

A reducing automaton (red-automaton) is a deterministic automaton proposed for checking word and sub-word correctness by the use of analysis by reduction, see [3, 4, 5]. Its monotone version characterizes the class of deterministic context-free languages(DCFL). We propose a method for a construction of a deterministic push-down transducer for any monotone reducing automaton which is able with the help of special output symbols to localize its pre?x and post-pre?x (in)consistencies, and certain types ofreducing con?icts.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

IN - Informatics

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

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

Publication year

2012

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

22nd THEORIETAG AUTOMATA AND FORMAL LANGUAGES

ISBN

978-80-7378-221-4

ISSN

—

e-ISSN

—

Number of pages

6

Pages from-to

115-120

Publisher name

Matfyzpress

Place of publication

Praha

Event location

Praha

Event date

Oct 3, 2012

Type of event by nationality

EUR - Evropská akce

UT code for WoS article

—