Alternating automatic register machines

DOI10.1007/978-3-031-17715-6_14arXiv2111.04254OpenAlexW4313014961MaRDI QIDQ6109475

Frank Stephan, Ammar Fathin Sabili, Sanjay Jain, Ziyuan Gao, Zeyong Li

Publication date: 28 July 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

computational complexitytheory of computationregister machineautomatic relationnondeterministic complexityalternating complexitymeasures of computation time

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Alternating automatic register machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Iterated sequential transducers as language generating devices
• Alternation and the Ackermann case of the decision problem
• Iterated uniform finite-state transducers: descriptional complexity of nondeterminism and two-way motion
• Automatic Functions, Linear Time and Learning
• Three Lectures on Automatic Structures
• Addition Machines
• Alternation
• Computability of Recursive Functions
• Automatic presentations of structures
• Alternating automatic register machines

This page was built for publication: Alternating automatic register machines