Real-Time Definable Languages
From MaRDI portal
Publication:5532536
DOI10.1145/321420.321423zbMath0153.00902OpenAlexW2041013848MaRDI QIDQ5532536
Publication date: 1967
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321420.321423
Related Items (27)
Counter machines and counter languages ⋮ WORD-HYPERBOLIC GROUPS HAVE REAL-TIME WORD PROBLEM ⋮ Real-time solutions of the origin-crossing problem ⋮ Quasi-realtime languages ⋮ Dynamical recognizers: real-time language recognition by analog computers ⋮ Characterization of real time iterative array by alternating device. ⋮ Complexity of algorithms and computations ⋮ QRT FIFO automata, breadth-first grammars and their relations ⋮ Diagonalization, uniformity, and fixed-point theorems ⋮ Minimum-complexity pairing functions ⋮ Computational power of one-way Turing machines with sublogarithmic memory restrictions ⋮ The computational power of parsing expression grammars ⋮ Equivalence problems for deterministic context-free languages and monadic recursion schemes ⋮ On equivalence and subclass containment problems for deterministic context-free languages ⋮ The generalised word problem in hyperbolic and relatively hyperbolic groups ⋮ A note on cyclic closure operations ⋮ Time-restricted sequence generation ⋮ A Hierarchy of Fast Reversible Turing Machines ⋮ Time- and tape-bounded Turing acceptors and AFLs ⋮ Real-time computations with restricted nondeterminism ⋮ Time-bounded grammars and their languages ⋮ Quantum automata and quantum grammars ⋮ Production en temps réel et complexité de structure de suites infinies ⋮ On the extension of Gladkij's theorem and the hierarchies of languages ⋮ On the power of real-time two-way multihead finite automata with jumps ⋮ Deterministic Turing machines in the range between real-time and linear-time. ⋮ COMBING NILPOTENT AND POLYCYCLIC GROUPS
This page was built for publication: Real-Time Definable Languages
