scientific article; zbMATH DE number 3628417

From MaRDI portal

Publication:4190162

Jump to:navigation, search

zbMath0404.68081MaRDI QIDQ4190162

Burchard von Braunmühl, Rutger Verbeek

Publication date: 1979

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Computational Complexity Nondeterministic Automata Abstract Family of Languages Deterministic Linear Bounded Automata Finite-Change Tape Languages Accepted By Automata Multitape Turing Machine Turing Tape

Mathematics Subject Classification ID

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

Related Items (6)

Regulated variants of limited context restarting automata ⋮ Characterization of context-pree languages by erasing automata ⋮ A Taxonomy of Deterministic Forgetting Automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On restarting automata with auxiliary symbols and small window size

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4190162&oldid=18029950"