Počet záznamů: 1

The Simplest Non-Regular Deterministic Context-Free Language

SYSNO ASEP	0543570
Druh ASEP	C - Konferenční příspěvek (mezinárodní konf.)
Zařazení RIV	D - Článek ve sborníku
Název	The Simplest Non-Regular Deterministic Context-Free Language
Tvůrce(i)	Jančar, P. (CZ) Šíma, Jiří (UIVT-O)_{RID, SAI, ORCID}
Celkový počet autorů	2
Číslo článku	63
Zdroj.dok.	46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021). - Dagstuhl : Dagstuhl Publishing, 2021 / Bonchi F. ; Puglisi S. J. - ISSN 1868-8969
Poč.str.	18 s.
Forma vydání	Online - E
Akce	MFCS 2021: International Symposium on Mathematical Foundations of Computer Science /46./
Datum konání	23.08.2021 - 27.08.2021
Místo konání	Tallinn
Země	EE - Estonsko
Typ akce	WRD
Jazyk dok.	eng - angličtina
Země vyd.	DE - Německo
Klíč. slova	deterministic context-free language ; truth-table reduction ; Mealy automaton ; pushdown automaton
Vědní obor RIV	IN - Informatika
Obor OECD	Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
CEP	GA19-05704S GA ČR - Grantová agentura ČR
Institucionální podpora	UIVT-O - RVO:67985807
EID SCOPUS	85115356156
DOI	10.4230/LIPIcs.MFCS.2021.63
Anotace	We introduce a new notion of C-simple problems for a class C of decision problems (i.e. languages), w.r.t. a particular reduction. A problem is C-simple if it can be reduced to each problem in C. This can be viewed as a conceptual counterpart to C-hard problems to which all problems in C reduce. Our concrete example is the class of non-regular deterministic context-free languages (DCFL'), with a truth-table reduction by Mealy machines. The main technical result is a proof that the DCFL' language L_# = {0^n1^n \| n>=1} is DCFL'-simple, and can be thus viewed as one of the simplest languages in the class DCFL', in a precise sense. The notion of DCFL'-simple languages is nontrivial: e.g., the language L_R = {wcw^R \| w in {a,b}^*} is not DCFL'-simple. By describing an application in the area of neural networks (elaborated in another paper), we demonstrate that C-simple problems under suitable reductions can provide a tool for expanding the lower-bound results known for single problems to the whole classes of problems.
Pracoviště	Ústav informatiky
Kontakt	Tereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
Rok sběru	2022

Počet záznamů: 1