Some Remarks on Abstract Machines

DOI10.2307/1993532zbMath0097.00501OpenAlexW4236277846MaRDI QIDQ3275833

Seymour Ginsburg

Publication date: 1960

Full work available at URL: https://doi.org/10.2307/1993532

zbMATH Keywords

philosophy and foundations of mathematics

Related Items (12)

Output Completeness in Sequential Machines ⋮ Finite approximants of compact totally disconnected machines ⋮ On the output function in a Ginsburg's machine ⋮ Transformation Semigroups for Rough Sets ⋮ DISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA ⋮ Products of Automata and the Problem of Covering ⋮ Data machines and standards, or the functional specification of information systems ⋮ Solvability of equivalence problem for program machines ⋮ On topological machines ⋮ Generalized \({}^{1,5}\) sequential machine maps ⋮ Distinguishability of a Semi-Group by a Machine ⋮ Structure de l'automate plein, reduit et inversible

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sequential Functions
• Linear Automaton Transformations
• Decision Problems of Finite Automata Design and Related Arithmetics
• SOME PROPERTIES OF CONVOLUTION MACHINES AND σ-COMPOSITE MACHINES
• ON THE EXISTENCE OF SHEFFER STROKE CLASS IN THE SEQUENTIAL MACHINES

This page was built for publication: Some Remarks on Abstract Machines