Non-Regularity of Complete CF(c,$)-Grammars

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F24%3A10492957" target="_blank" >RIV/00216208:11320/24:10492957 - isvavai.cz</a>

Výsledek na webu

<a href="https://ceur-ws.org/Vol-3792/paper8.pdf" target="_blank" >https://ceur-ws.org/Vol-3792/paper8.pdf</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Non-Regularity of Complete CF(c,$)-Grammars

Popis výsledku v původním jazyce

It is studied pumping analysis by reduction represented by complete CF( |c,$)-grammars and their languages. A completeCF( |c,$)-grammar generates both a language and its complement. Complete CF( |c,$)-grammars serve as a tool to study theclass of context-free languages that are closed under complement. Recall that the class of context-free grammars is the singleclass of languages from the Chomsky hierarchy that is not closed under the complement.The pumping reductions used in this paper ensure a correctness- and error-preserving pumping analysis by reduction foreach word over its input alphabet. We introduce tests for each pumping reduction, which serve as tests of non-regularity foraccepted and rejected languages by corresponding grammars. That can help to develop natural error localization and errorrecovery techniques for languages defined by complete CF( |c,$)-grammars.

Název v anglickém jazyce

Non-Regularity of Complete CF(c,$)-Grammars

Popis výsledku anglicky

It is studied pumping analysis by reduction represented by complete CF( |c,$)-grammars and their languages. A completeCF( |c,$)-grammar generates both a language and its complement. Complete CF( |c,$)-grammars serve as a tool to study theclass of context-free languages that are closed under complement. Recall that the class of context-free grammars is the singleclass of languages from the Chomsky hierarchy that is not closed under the complement.The pumping reductions used in this paper ensure a correctness- and error-preserving pumping analysis by reduction foreach word over its input alphabet. We introduce tests for each pumping reduction, which serve as tests of non-regularity foraccepted and rejected languages by corresponding grammars. That can help to develop natural error localization and errorrecovery techniques for languages defined by complete CF( |c,$)-grammars.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2024

Kód důvěrnosti údajů

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

Název statě ve sborníku

Proceedings of the 24th Conference Information Technologies – Applications and Theory (ITAT 2024)

ISBN

—

ISSN

1613-0073

e-ISSN

1613-0073

Počet stran výsledku

6

Strana od-do

75-80

Název nakladatele

CEUR-WS.org

Místo vydání

Aachen, DE

Místo konání akce

Drienica, Slovakia

Datum konání akce

20. 9. 2024

Typ akce podle státní příslušnosti

EUR - Evropská akce

Kód UT WoS článku

—