On regular realizability problems for context-free languages

DOI10.1134/S0032946015040043zbMATH Open1386.68098OpenAlexW2341616572MaRDI QIDQ327306FDOQ327306

Authors: Mikhail Vyalyi, Alexander A. Rubtsov 

Publication date: 19 October 2016

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946015040043

Recommendations

• Regular Realizability Problems and Context-Free Languages
• On regular realizability problems
• On expressive power of regular realizability problems
• Universality of Regular Realizability Problems
• Rational index of context-free languages in exp \(\Theta(^ p\sqrt{n})\) and \(n^{\Theta((\ln n)^{1/p})}\)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Computational Complexity
• Title not available (Why is that?)
• On regular realizability problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Detecting palindromes, patterns and borders in regular languages
• Rational indexes of generators of the cone of context-free languages
• On expressive power of regular realizability problems
• Context-free languages with rational index in $\Theta (n^\gamma )$ for algebraic numbers $\gamma $
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Rational Index: A Complexity Measure for Languages
• Title not available (Why is that?)
• One-counter verifiers for decidable languages
• Title not available (Why is that?)
• An Infinite Hierarchy of Context-Free Languages

Cited In (7)

• Rational index of context-free languages in exp \(\Theta(^ p\sqrt{n})\) and \(n^{\Theta((\ln n)^{1/p})}\)
• Regular Realizability Problems and Context-Free Languages
• Properties of graphs specified by a regular language
• On the decidability of finding a positive ILP-instance in a regular set of ILP-instances
• From decidability to undecidability by considering regular sets of instances
• Properties of graphs specified by a regular language
• On expressive power of regular realizability problems

This page was built for publication: On regular realizability problems for context-free languages

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