On computational complexity of set automata

DOI10.1007/978-3-319-62809-7_25zbMath1494.68148arXiv1704.03730OpenAlexW2605556695MaRDI QIDQ5920130

Mikhail N. Vyalyi, Alexander A. Rubtsov

Publication date: 13 October 2017

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1704.03730

zbMATH Keywords

computational complexityautomata theorymembership problemformal languagesrational coneset automata

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (2)

On computational complexity of set automata ⋮ Automata equipped with auxiliary data structures and regular realizability problems

This page was built for publication: On computational complexity of set automata