The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.

## Filters

##
###
Page 381 of Mathematical Reviews Vol. 52, Issue 1
[page]

1976
*
Mathematical Reviews
*

*For*an

*incompletely*

*specified*

*sequential*

*machine*(ISSM) the input memory ,, [the output memory jo] is defined as the least integer » such that every

*applicable*input sequence [every output sequence generated ... Shirtladze (Tbilisi) 2774 Toke, Arun Narayan; Vairavan, K. 2775

*Some*memory characteristics of

*incompletely*

*specified*

*sequential*

*machines*. Information and Control 28 (1975), 54-64. ...

##
###
Page 1453 of Mathematical Reviews Vol. 52, Issue 4
[page]

1976
*
Mathematical Reviews
*

In contrast

*to*the uniqueness of*minimal**machines**for*the case of completely*specified**sequential**machines*, an*incompletely**specified**sequential**machine*(ISSM) need not necessarily have a unique*minimal*... One of the most fundamental problems*for**sequential**machines*is*minimizing*the number of*states*in a given*machine*. ...##
###
Cumulative subject index volumes 30–32

1976
*
Information and Control
*

theory, 32, 101

doi:10.1016/s0019-9958(76)90300-4
fatcat:6uhmar7mq5bq3emjcviioes64a
*state*,*for*systems*with*interrupted observations, 32, 146 Extrapolation in*incompletely**specified*environment, 30, 203 Feedback channels*with*,*sequential*coding*for*, 32, 93 ...*Sequential*coding*for*channels*with*feedback, 32, 93*Sequential*decision process finite automata*with*cost function, 31, 153*Sequential**machines*linear, synthesis, 32, 112 Sets difference, in ...##
###
Permissible observability relations in FSM networks

1994
*
Proceedings of the 31st annual conference on Design automation conference - DAC '94
*

Previous attempts

doi:10.1145/196244.196613
dblp:conf/dac/WangB94
fatcat:ukxqusfhbvfjnhhbvyuhevv25m
*to*capture the phenomenon of output don't care sequences*for*a component in an FSM network have been*incomplete*. ... The representation*for*a set of permissible observability relations is not unique. We provide a method*to*find a set*with*the minimum number of permissible relations. ... Also special thanks*to*Szu-Tsung Cheng and Thomas Shiple*for*helpful discussions on the BDD package. ...##
###
Coinductive Models of Finite Computing Agents

1999
*
Electronical Notes in Theoretical Computer Science
*

Maximal fixed points are shown

doi:10.1016/s1571-0661(05)80270-1
fatcat:aqfntxxu2jcxxhwsdmgj4bc5za
*to*play a role in models of observation that parallels*minimal*fixed points in inductive mathematics. ... X = algorithms, Y = Turing*machines*In section 5 we extend the Church-Turing thesis from algorithms*to**sequential*and multi-agent interaction by extending both the intuitive notion X of computation and ... Turing*machine*: TMs are*state*-transition*machines*M = (S, T, s 0 , F ),*with*finite sets of*states*S and tape symbols T , a starting*state*s 0 , and a statetransition relation F : S × T → S × T . ...##
###
Page 4077 of Mathematical Reviews Vol. , Issue 80J
[page]

1980
*
Mathematical Reviews
*

An

*incompletely**specified*(or partial)*sequential**machine*usually means a system in which*some*elements are undefined. ... The main idea of this paper is*to*present any*incompletely**specified*object of a certain type (vector, matrix, stochastic or pseudostochastic*sequential**machine*) as a set of completely*specified*objects ...##
###
Page 2369 of Mathematical Reviews Vol. , Issue 81F
[page]

1981
*
Mathematical Reviews
*

Yamamoto, Masaru 81f:68064 A method

*for**minimizing**incompletely**specified**sequential**machines*. IEEE Trans. Comput. 29 (1980), no. 8, 732-736. ... Muntean [Automatic finite synthesis (Romanian), Tehnica, Bucharest, 1977], we give an algorithm*for**minimizing**incompletely**specified**sequential**machines*.” ...##
###
Page 742 of Mathematical Reviews Vol. 38, Issue 4
[page]

1969
*
Mathematical Reviews
*

From this structure is derived an algorithm

*for*cal- culating a*minimal*closed covering of the*states*in an*incomplete**sequential**machine*.” ... Bouchet, A. 4214 An algebraic method*for**minimizing*the number of*states*in an*incomplete**sequential**machine*. IEEE Trans. Computers C-17 (1968), 795-798. ...##
###
Page 996 of Mathematical Reviews Vol. 54, Issue 3
[page]

1977
*
Mathematical Reviews
*

The equivalent graph. theoretic problem is

*to*enumerate all cliques in the complement graph G’, Paull and Unger in 1959 proposed an algorithm*for**minimizing*the number of*states*in an*incompletely**specified*... In designing*incompletely**specified**sequential**machines*, the following problem is of central importance: Given a set of pair- wise “incompatible” Boolean variables, find all maximal sets of variables that ...##
###
Page 4884 of Mathematical Reviews Vol. 58, Issue 6
[page]

1979
*
Mathematical Reviews
*

By apply- ing this

*to*the*state**minimizing*problem of*incompletely**specified**sequential**machines*, we obtain results on the problem of estima- tion of the complexity of known*minimizing*algorithms, as formulated ... The first one is the Krohn-Rhodes decomposition*theorem**for**sequential*functions, i.e.,*for*input-output maps of*sequential**machines*. ...##
###
Comments on "Closure Partition Method for Minimizing Incomplete Sequential Machines"

1975
*
IEEE transactions on computers
*

These versions are

doi:10.1109/t-c.1975.224090
fatcat:u5qe2n2kzzfpdoj2wndc4tmt3i
*applicable**to*arbitrary subsets of the*state*set of a*sequential**machine*. Index Terms-Closure class, implied block,*sequential**machine*. ... This correspondence provides*some*clarifications and revision*to*the above-mentioned paper.' It also presents the generalized versions of the definitions and*theorems*related*to*closure classes. ... INTRODUCTION As seen from the above-mentioned paper' and [1E] [21, the concept of closure class is not only useful*for**minimizing*an*incomplete**sequential**machine*,' but also in solving other problems ...##
###
Page 763 of Mathematical Reviews Vol. , Issue 80B
[page]

1980
*
Mathematical Reviews
*

This paper deals

*with*upper bounds on the finite input-memory p,; mt and finite output-memory p, of n-*state*completely*specified*rague)*sequential**machines*and*incompletely**specified**sequential*mac- hines ... A*sequential**machine*M is said*to*have finite input-memory yp; if all*applicable*input sequences of length p, define a unique*state*. ...##
###
Transforming Boolean relations by symbolic encoding
[chapter]

1995
*
Lecture Notes in Computer Science
*

This paper develops a framework

doi:10.1007/3-540-60385-9_10
fatcat:dgl7hqrbnjcefjraj45demzcmq
*for*analyzing input/output transformations of Boolean relations and functions. ... Experimental results on equivalence-preserving FSM*state*-space re-encoding demonstrate the feasibility of the approach. ... They can also contribute*to*the exact or approximate*state**minimization*of a*machine*, mapping all*states*belonging*to*the same equivalence class onto one code [4] . ...##
###
Direct Transition Memory and its Application in Computer Design

1974
*
IEEE transactions on computers
*

A design technique is developed which,

doi:10.1109/t-c.1974.223805
fatcat:6ufm2acf4vbjzjd4jvmfc5zu3a
*for*a given*state*table, allows a minimum number of memory address variables*to*be used while*minimizing*the dependence of the variables on both the input and current ... This paper investigates a potential*application*of microprogrammable memories*to*the problem of*sequential*network synthesis and computer design. ... This approach allows a complete solution*to*be defined*for*completely*specified**state*tables, and is*applicable*in a heuristic manner*for**incompletely**specified**state*tables. ...##
###
Page 323 of Mathematical Reviews Vol. , Issue 82a
[page]

1982
*
Mathematical Reviews
*

The concept of

*states*of a*sequential**machine*is extended and transferred*to*switching theory. ... The result implies the following:*For*any subclass C of real-time dpda’s*with*empty stack acceptance, the problem*for*deciding whether a dpda is equivalent*to**some**machine*in C reduces*to*that*for*deciding ...
« Previous

*Showing results 1 — 15 out of 6,993 results*