scientific article

zbMath0492.68003MaRDI QIDQ3954784

Jack B. Dennis, Peter J. Denning, Joseph E. Qualitz

Publication date: 1978

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

zbMATH Keywords

finite automatacontext-free languagesregular languagesrecursive functionspushdown automataregular setsunsolvable problemsturing machinesgeneralized sequential machinesPost systemssyntax analysistape automatatwo-way acceptors

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Abstract data types; algebraic specification (68Q65) Algorithms in computer science (68W99) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Computability and recursion theory (03Dxx)

Related Items

On the decidability of equivalence for deterministic pushdown transducers ⋮ Physics of selective systems: Computation and biology ⋮ Two-way automata and length-preserving homomorphisms ⋮ Equivalence, reduction and minimization of finite automata over semirings ⋮ Minimum-complexity pairing functions ⋮ Imperative-program transformation by instrumented-interpreter specialization ⋮ Unnamed Item ⋮ On the Formalization of Some Results of Context-Free Language Theory ⋮ The end of pumping ⋮ Transformations of one-dimensional cellular automaton rules by translation-invariant local surjective mappings ⋮ Fuzzy acceptors for syntactic pattern recognition