The hardest language for grammars with context operators
From MaRDI portal
Publication:6038689
DOI10.1016/j.tcs.2023.113829arXiv2012.03596MaRDI QIDQ6038689
Alexander Okhotin, Mikhail Mrykhin
Publication date: 2 May 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.03596
formal grammars; formal language theory; finite transducers; inverse homomorphisms; grammars with context operators; hardest formal languages
68Qxx: Theory of computing