On regular realizability problems for context-free languages
type: Item
instance of: scholarly article
title: On regular realizability problems for context-free languages
zbMATH Open document ID: 1386.68098
DOI: 10.1134/S0032946015040043
published in: Problems of Information Transmission
publication date: 2016-10-19T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6640704
author: Mikhail Vyalyi
author: Alexander A. Rubtsov
MaRDI profile type: Publication
cites work: Detecting palindromes, patterns and borders in regular languages
cites work: On regular realizability problems
cites work: On expressive power of regular realizability problems
cites work: Q3859267
cites work: Q3873564
cites work: Context-free languages with rational index in $\Theta (n^\gamma )$ for algebraic numbers $\gamma $
cites work: Computational Complexity
cites work: Q3392273
cites work: Q4385528
cites work: An Infinite Hierarchy of Context-Free Languages
cites work: Q4843270
cites work: Q3686060
cites work: One-Counter Verifiers for Decidable Languages
cites work: The Rational Index: A Complexity Measure for Languages
cites work: Rational indexes of generators of the cone of context-free languages
cites work: Q5180413
full work available at URL: s0032946015040043
OpenAlex ID: W2341616572
description: scientific article; zbMATH DE number 6640704