On regular realizability problems
From MaRDI portal
Publication:375967
DOI10.1134/S003294601104003XzbMATH Open1276.68083MaRDI QIDQ375967FDOQ375967
Authors: Mikhail Vyalyi 
Publication date: 1 November 2013
Published in: Problems of Information Transmission (Search for Journal in Brave)
Recommendations
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?)
- A note on succinct representations of graphs
- Title not available (Why is that?)
- Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata
- On Models of a Nondeterministic Computation
Cited In (12)
- The realizability problem for Golovach-type functions
- Orbits of linear maps and regular languages
- Orbits of linear maps and properties of regular languages
- Regular Realizability Problems and Context-Free Languages
- On regular realizability problems for context-free languages
- On excluded minors for real-representability
- 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
- On universality of regular realizability problems
- Universality of Regular Realizability Problems
- Automata equipped with auxiliary data structures and regular realizability problems
- Title not available (Why is that?)
This page was built for publication: On regular realizability problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q375967)
