Real-Time Definable Languages

DOI10.1145/321420.321423MaRDI QIDQ5532536zbMATH OpenOpenAlexFDO

Authors Arnold L. Rosenberg

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

zbMATH Keywords

mathematical logic

Recommendations

• Quasi-realtime languages (extended abstract)
• Decidability and Expressive Power of Real Time Logics
• scientific article; zbMATH DE number 1502114
• Real-time logics: Complexity and expressiveness
• scientific article; zbMATH DE number 4205999
• Foundations of Software Science and Computation Structures
• Realizability of real-time logics
• scientific article; zbMATH DE number 1231547

Cited in

(27)

• WORD-HYPERBOLIC GROUPS HAVE REAL-TIME WORD PROBLEM
• Deterministic Turing machines in the range between real-time and linear-time.
• The generalised word problem in hyperbolic and relatively hyperbolic groups
• Real-time computations with restricted nondeterminism
• A note on cyclic closure operations
• Counter machines and counter languages
• Quantum automata and quantum grammars
• Real-time solutions of the origin-crossing problem
• Quasi-realtime languages
• On the extension of Gladkij's theorem and the hierarchies of languages
• Characterization of real time iterative array by alternating device.
• Complexity of algorithms and computations
• Computational power of one-way Turing machines with sublogarithmic memory restrictions
• Realizability of Dynamic MSC Languages
• QRT FIFO automata, breadth-first grammars and their relations
• Dynamical recognizers: real-time language recognition by analog computers
• Time- and tape-bounded Turing acceptors and AFLs
• Diagonalization, uniformity, and fixed-point theorems
• A hierarchy of fast reversible Turing machines
• Time-restricted sequence generation
• Minimum-complexity pairing functions
• Time-bounded grammars and their languages
• On the power of real-time two-way multihead finite automata with jumps
• On equivalence and subclass containment problems for deterministic context-free languages
• Production en temps réel et complexité de structure de suites infinies
• Equivalence problems for deterministic context-free languages and monadic recursion schemes
• COMBING NILPOTENT AND POLYCYCLIC GROUPS

This page was built for publication: Real-Time Definable Languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5532536)