On universality of regular realizability problems
From MaRDI portal
Publication:6660012
DOI10.1134/S0032946024030050MaRDI QIDQ6660012
Alexander A. Rubtsov, Mikhail Vyalyi
Publication date: 10 January 2025
Published in: Problems of Information Transmission (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On regular realizability problems
- Unary finite automata vs. arithmetic progressions
- Finite automata and unary languages
- Complexity of generation
- From decidability to undecidability by considering regular sets of instances
- On expressive power of regular realizability problems
- On Models of a Nondeterministic Computation
- Randomness conductors and constant-degree lossless expanders
- Re-pairing brackets
- Regular Realizability Problems and Context-Free Languages
- Properties of graphs specified by a regular language
- Reachability analysis of pushdown automata: Application to model-checking
This page was built for publication: On universality of regular realizability problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6660012)
