Characterizations of LRR-languages by correctness-preserving computations

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F18%3A10389401" target="_blank" >RIV/00216208:11320/18:10389401 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Characterizations of LRR-languages by correctness-preserving computations

Original language description

We present a transformation from several types of monotone deterministic two-way restarting list automata (RLAs) that do not have any type of correctness preserving property into several types of monotone deterministic RLAs that satisfy the complete strong correctness preserving property. These types of automata provide new characterizations for the class LRR of left-to-right regular languages, which are suitable for the (lexical) disambiguation of the syntactic analysis of individual LRR-languages and for the localization of syntactical errors.

Czech name

—

Czech description

—

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)

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2018

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

Tenth Workshop on Non-Classical Models of Automata and Applications, NCMA 2018, Košice, Slovakia, August 21-22, 2018

ISBN

978-3-903035-21-8

ISSN

—

e-ISSN

neuvedeno

Number of pages

16

Pages from-to

149-164

Publisher name

Österreichische Computer Gesellschaft

Place of publication

Wien

Event location

Košice

Event date

Aug 21, 2018

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—