Behavioral strengths and weaknesses of various models of limited automata

DOI10.1007/978-3-030-10801-4_40zbMath1445.68128arXiv2111.05000OpenAlexW2911116314MaRDI QIDQ2206256

Tomoyuki Yamakami

Publication date: 22 October 2020

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

zbMATH Keywords

pushdown automatareversalprobabilistic computationlimited automataone-sided errorblank skipping propertybounded-error probability

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

Performing regular operations with 1-limited automata ⋮ Unnamed Item ⋮ Formal grammars for turn-bounded deterministic context-free languages ⋮ Nondeterministic auxiliary depth-bounded storage automata and semi-unbounded fan-in cascading circuits (extended abstract) ⋮ Between SC and LOGDCFL: families of languages accepted by polynomial-time logarithmic-space deterministic auxiliary depth-\(k\) storage automata ⋮ How does adiabatic quantum computation fit into quantum automata theory?

This page was built for publication: Behavioral strengths and weaknesses of various models of limited automata