scientific article; zbMATH DE number 3167394

zbMATH Open0102.33804MaRDI QIDQ3285871FDOQ3285871

Authors: Seymour Ginsburg 

Publication date: 1962

Title of this publication is not available (Why is that?)

zbMATH Keywords

numerical analysis

Cited In (47)

• Übertragung automatentheoretischer Sätze auf Chomsky-Sprachen
• On a group-matrix type automaton with output
• On the regularity of sets of multi-accepted strings of a non-deterministic finite automaton
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• On the inference of Turing machines from sample computations
• A practical general method for constructing LR(k) parsers
• A formalization of measurement scale forms
• Sur une variante des fonctions séquentielles
• Products of Automata and the Problem of Covering
• AN AUTOMATA-THEORETICAL APPROACH TO DEVELOPING LEARNING NEURAL NETWORKS
• Automata theory and control theory - a rapprochement
• Output Completeness in Sequential Machines
• Abstract biological systems as sequential machines
• On categories of infinite automata
• Rosen's \((M,R)\) system as an X-machine
• On topological machines
• A survey of state vectors
• A Theory of Computer Instructions
• Tree acceptors and some of their applications
• Arithmetische Prädikate über einem Bereich endlicher Automaten
• Deterministic automata. Simulation, universality and minimality
• A mode of decomposition of regular languages
• Computing the ideal structure of finite semigroups
• Eine Bemerkung zur Zustandsreduktion unvollständiger Automaten
• The common algebraic structure of exit-automata and machines
• On some properties of the free monoids with applications to automata theory
• Generalizing finiteness conditions of labelled transition systems
• On homomorphic images of transition graphs
• Title not available (Why is that?)
• Enumerating regular expressions and their languages
• Permutation automata
• Construction of recognition devices for regular languages from their Backus Normal Form definition
• Finite synchronous automata
• Fuzzy star functions, probabilistic automata, and their approximation by non-probabilistic automata
• Fuzzy neural networks
• Data machines and standards, or the functional specification of information systems
• On the corrective control of sequential machines
• Zur Theorie endlicher Automaten
• Der programmierbare endliche Automat. (The programmable finite automaton)
• On optimization of numerical algorithms
• Fuzzy acceptors for syntactic pattern recognition
• On the control of incompletely described sequential machines
• Abstract biological systems as sequential machines: Behavioral reversibility
• Minimal solutions of Paull-Unger problems
• Two definitions of the equivalence of automata
• Some results on the relation between automata and their automorphism groups
• Finiteness conditions for finitely generated monoids

This page was built for publication:

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