Some complete -powers of a one-counter language, for any Borel class of finite rank

From MaRDI portal
Publication:2219094

DOI10.1007/S00153-020-00737-4zbMATH Open1498.03104arXiv2006.08174OpenAlexW3034452194MaRDI QIDQ2219094FDOQ2219094


Authors: Olivier Finkel, Dominique Lecomte Edit this on Wikidata


Publication date: 19 January 2021

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Abstract: We prove that, for any natural number n ge 1, we can find a finite alphabet Sigma and a finitary language L over Sigma accepted by a one-counter automaton, such that the omega-power L infty := {w 0 w 1. .. in Sigma omega | foralli in omega w i in L} is Pi 0 n-complete. We prove a similar result for the class Sigma 0 n .


Full work available at URL: https://arxiv.org/abs/2006.08174




Recommendations




Cites Work


Cited In (6)





This page was built for publication: Some complete \(\omega\)-powers of a one-counter language, for any Borel class of finite rank

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2219094)