2000 character limit reached
On universality of regular realizability problems
Published 26 Nov 2023 in cs.FL | (2311.15381v3)
Abstract: We prove the universality of the regular realizability problems for several classes of filters. The filters are encodings of finite relations on the set of non-negative integers in the format proposed by P. Wolf and H. Fernau. The universality has proven up to disjunctive truth table polynomial reductions for unary relations and polynomial space reductions for invariant binary relations. Stronger reductions correspond to the results of P. Wolf and H. Fernau about decidability of regular realizability problems for many graph-theoretic properties.
- Complexity Zoo. Zookeeper: Scott Aaronson. Veterinarian: Greg Kuperberg. https://complexityzoo.net/Complexity_Zoo.
- M. Chrobak. Finite automata and unary languages. In TCS 302 (2003) 497–-498.
- V. Guruswami. Error-correcting Codes and Expander Graphs. SIGACT News Complexity Theory Column 45, 2004.
- A. Martinez. Efficient computation of regular expressions from unary NFAs. In DFCS’02, pages 174–-187.
- Rubtsov A., Vyalyi M. Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems // arXiv: 2210.03934v1
- Alexander Schrijver. Theory of Linear and Integer Programming. Wiley, 1998. 484 p.
- A. W. To. Unary finite automata vs. arithmetic progressions. IPL 109(17): 1010–1014 (2009)
- Wolf P., Fernau H. Regular Intersection Emptiness of Graph Problems: Finding a Needle in a Haystack of Graphs with the Help of Automata. arXiv: 2003.05826v1
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.