scientific article; zbMATH DE number 3167394

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
On the inference of Turing machines from sample computations
Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
A practical general method for constructing LR(k) parsers
A formalization of measurement scale forms
Sur une variante des fonctions séquentielles
Automata theory and control theory - a rapprochement
AN AUTOMATA-THEORETICAL APPROACH TO DEVELOPING LEARNING NEURAL NETWORKS
Products of Automata and the Problem of Covering
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
Tree acceptors and some of their applications
Deterministic automata. Simulation, universality and minimality
Arithmetische Prädikate über einem Bereich endlicher Automaten
A Theory of Computer Instructions
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
scientific article; zbMATH DE number 3241280 (Why is no real title available?)
Enumerating regular expressions and their languages
Fuzzy neural networks
Fuzzy star functions, probabilistic automata, and their approximation by non-probabilistic automata
Permutation automata
Construction of recognition devices for regular languages from their Backus Normal Form definition
Finite synchronous automata
Data machines and standards, or the functional specification of information systems
On the corrective control of sequential machines
Zur Theorie endlicher Automaten
Fuzzy acceptors for syntactic pattern recognition
Der programmierbare endliche Automat. (The programmable finite automaton)
Two definitions of the equivalence of automata
On optimization of numerical algorithms
On the control of incompletely described sequential machines
Abstract biological systems as sequential machines: Behavioral reversibility
Minimal solutions of Paull-Unger problems
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)