Automata equipped with auxiliary data structures and regular realizability problems
From MaRDI portal
Publication:2096592
DOI10.1007/978-3-030-93489-7_13OpenAlexW4205532252MaRDI QIDQ2096592
Alexander A. Rubtsov, Mikhail N. Vyalyi
Publication date: 9 November 2022
Full work available at URL: https://arxiv.org/abs/2210.03934
Related Items (3)
New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines ⋮ Properties of graphs specified by a regular language ⋮ On the decidability of finding a positive ILP-instance in a regular set of ILP-instances
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On regular realizability problems
- Detecting palindromes, patterns and borders in regular languages
- On emptiness and membership problems for set automata
- Set Automata
- On Models of a Nondeterministic Computation
- Regular Realizability Problems and Context-Free Languages
- An Approach to a Unified Theory of Automata
- On computational complexity of set automata
- On the decidability of finding a positive ILP-instance in a regular set of ILP-instances
This page was built for publication: Automata equipped with auxiliary data structures and regular realizability problems
