Algebraic Theory of Automata 1968
DOI: 10.1016/b978-1-4832-0013-2.50009-6
|View full text |Cite
|
Sign up to set email alerts
|

Coverings of Automata

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

1978
1978
2019
2019

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 52 publications
(15 citation statements)
references
References 0 publications
0
9
0
Order By: Relevance
“…We introduce finite-state automata, c.f. (Ginzburg 1968;Hopcroft and Ullman 1979), which here we term simply automata.…”
Section: Automatamentioning
confidence: 99%
“…We introduce finite-state automata, c.f. (Ginzburg 1968;Hopcroft and Ullman 1979), which here we term simply automata.…”
Section: Automatamentioning
confidence: 99%
“…Suppose the control structure has more than one internal state or condition in which it can find itself at the end of an interaction, and note that the particular state in which it does terminate depends on (is partially determined by) the environment with which the interaction is taking place (that is, suppose the system is a Moore machine that is also a recognizer; see Ginzburg, 1968). Then, the particular final state in which the interaction terminates will serve to classify that environment: tire environment will be of the sort that yields final state A, say, or final state B.…”
Section: The Relationship O F Knowingmentioning
confidence: 99%
“…Automata theory and Turing machine theory are the particular languages that 1 have been most concerned with to date (sec Davis, 1958;Ginzburg, 1968;Minsky, 1967). does not yield a condition in the system for which the system's actions are not defined -that is, insofar as the interaction is well defined from the system's perspective.…”
Section: The Relationship O F Knowingmentioning
confidence: 99%
“…Our methodology is based on automata theory [ 18 , 19 ], where the concept of philosophical zombies has a natural interpretation in terms of “emulation” [ 20 ]. The goal of our methodology is to demonstrate that it is possible to isomorphically emulate an integrated finite-state automaton ( ) with a feed-forward finite-state automaton ( ) using techniques closely related to the Krohn–Rhodes theorem [ 16 , 21 ].…”
Section: Methodsmentioning
confidence: 99%