MENESES GUIMARÄES DE ALMEIDA, Jorge Manuel, Jana BARTOŇOVÁ, Ondřej KLÍMA and Michal KUNC. On decidability of intermediate levels of concatenation hierarchies. In Igor Potapov. Developments in Language Theory : 19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015, Proceedings. Berlin: Springer, 2015, p. 58-70. ISBN 978-3-319-21499-3. Available from: https://dx.doi.org/10.1007/978-3-319-21500-6_4.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name On decidability of intermediate levels of concatenation hierarchies
Authors MENESES GUIMARÄES DE ALMEIDA, Jorge Manuel (620 Portugal), Jana BARTOŇOVÁ (203 Czech Republic, belonging to the institution), Ondřej KLÍMA (203 Czech Republic, belonging to the institution) and Michal KUNC (203 Czech Republic, guarantor, belonging to the institution).
Edition Berlin, Developments in Language Theory : 19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015, Proceedings, p. 58-70, 13 pp. 2015.
Publisher Springer
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10101 Pure mathematics
Country of publisher Germany
Confidentiality degree is not subject to a state or trade secret
Publication form printed version "print"
Impact factor Impact factor: 0.402 in 2005
RIV identification code RIV/00216224:14310/15:00081142
Organization unit Faculty of Science
ISBN 978-3-319-21499-3
ISSN 0302-9743
Doi http://dx.doi.org/10.1007/978-3-319-21500-6_4
UT WoS 000364183600004
Keywords in English quantifier alternation hierarchy of first-order logic; concatenation hierarchy of regular languages; pseudovariety of ordered monoids; membership problem
Tags AKR, rivok
Tags International impact, Reviewed
Changed by Changed by: Ing. Andrea Mikešková, učo 137293. Changed: 20/4/2016 10:51.
Abstract
It is proved that if definability of regular languages in the Sigma_n fragment of the first-order logic on finite words is decidable, then it is decidable also for the Delta_{n+1} fragment. In particular, the decidability for Delta_5 is obtained. More generally, for every concatenation hierarchy of regular languages, it is proved that decidability of one of its half levels implies decidability of the intersection of the following half level with its complement.
Links
GA15-02862S, research and development projectName: Aplikace algebry a kombinatoriky v teorii formálních jazyků
Investor: Czech Science Foundation
PrintDisplayed: 3/5/2024 14:44