DOIAbstract
A generalized theory of incompletely specified machines is described in whichspecification of various alternative outputs is possible for any given input. Also, certain inputs may be prohibited. Algorithms for state reduction are given
A generalized theory of incompletely specified machines is described in whichspecification of various alternative outputs is possible for any given input. Also, certain inputs may be prohibited. Algorithms for state reduction are given
The problem of generalized pair decomposition (GPD) allowing two-way interconnections for incomplete...
definition to indicate an empty set, the symbol having pre-viously been widely used as a functional ...
Input-memory (μi) and output-memory (μo) characteristics of Sequential Machines (SM's) have been wid...
A generalized theory of incompletely specified machines is described in whichspecification of variou...
A simple procedure for the state minimization of an incompletely specified sequential machine whose ...
This paper presents a generalized minimal realization theory of machines in a category which contain...
We propose a new algorithm to the problem of state reduction in incompletely specified finite state ...
Part 5: Modelling and OptimizationInternational audienceThis paper presents a heuristic method for m...
In this paper we investigate the negative effects of state reduction on the realization of a sequent...
This paper is devoted to decomposition of sequential machines, discrete functions and relations. Seq...
It is shown that there is an infinite number of reduced deterministic finite machines, all of which ...
Tez (Doktora) -- İstanbul Teknik Üniversitesi, Fen Bilimleri Enstitüsü, 2003Thesis (PhD) -- İstanbul...
At the turn of the century, David Hilbert, a famous mathematician and leader of the formalist school...
It is shown that the uniform halting problem for one-state Turing machines is solvable. It remains s...
Often, the desired behavior of a system is known before a design of the system is known. It usually ...
The problem of generalized pair decomposition (GPD) allowing two-way interconnections for incomplete...
definition to indicate an empty set, the symbol having pre-viously been widely used as a functional ...
Input-memory (μi) and output-memory (μo) characteristics of Sequential Machines (SM's) have been wid...
A generalized theory of incompletely specified machines is described in whichspecification of variou...
A simple procedure for the state minimization of an incompletely specified sequential machine whose ...
This paper presents a generalized minimal realization theory of machines in a category which contain...
We propose a new algorithm to the problem of state reduction in incompletely specified finite state ...
Part 5: Modelling and OptimizationInternational audienceThis paper presents a heuristic method for m...
In this paper we investigate the negative effects of state reduction on the realization of a sequent...
This paper is devoted to decomposition of sequential machines, discrete functions and relations. Seq...
It is shown that there is an infinite number of reduced deterministic finite machines, all of which ...
Tez (Doktora) -- İstanbul Teknik Üniversitesi, Fen Bilimleri Enstitüsü, 2003Thesis (PhD) -- İstanbul...
At the turn of the century, David Hilbert, a famous mathematician and leader of the formalist school...
It is shown that the uniform halting problem for one-state Turing machines is solvable. It remains s...
Often, the desired behavior of a system is known before a design of the system is known. It usually ...
The problem of generalized pair decomposition (GPD) allowing two-way interconnections for incomplete...
definition to indicate an empty set, the symbol having pre-viously been widely used as a functional ...
Input-memory (μi) and output-memory (μo) characteristics of Sequential Machines (SM's) have been wid...
Add to ORKG