scientific article; zbMATH DE number 5593330
From MaRDI portal
Publication:5192993
DOI10.25596/jalc-2009-107zbMath1191.68308MaRDI QIDQ5192993
Publication date: 10 August 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items
Space Complexity of Stack Automata Models, A linear-time simulation of deterministic \(d\)-limited automata, A computation model with automatic functions and relations as primitive operations, Weight-reducing Turing machines, Verifying time complexity of Turing machines, Iterated uniform finite-state transducers on unary languages, Linear-time limited automata, Verifying whether one-tape Turing machines run in linear time, Complexity of Nondeterministic Multitape Computations Based on Crossing Sequences, Converting nondeterministic two-way automata into small deterministic linear-time machines, Space Complexity of Stack Automata Models
