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

## Filters

##
###
Page 8887 of Mathematical Reviews Vol. , Issue 2000m
[page]

2000
*
Mathematical Reviews
*

The simplest class of

*self*-*modifying**finite**automata*, called the single-register first-order*self*-*modifying**finite**automata*(ISMFAs), is of particular interest because while retaining much of the simplicity ... This result was extended to the class of ultralinear languages, and some upper bounds on the accepting power of*self*-*modifying**finite**automata*were es- tablished by Shutt [“*Self*-*modifying**finite**automata*—power ...##
###
Permutation Groups in Automata Diagrams

2013
*
Malaysian Journal of Fundamental and Applied Sciences
*

There are two types of

doi:10.11113/mjfas.v9n1.79
fatcat:eamfsycd7vgz7c2lpcyoebavhu
*automata*used to study the properties of a group, namely*modified**finite**automata*and*modified*Watson-Crick*finite**automata*. ... In the study of*automata*and group theory, it has been found that the properties of a group can be recognized by the*automata*using the*automata*diagrams. ... the corresponding*modified**finite**automata*. ...##
###
Geometrical Representation of Automata over Some Abelian Groups

2014
*
Malaysian Journal of Fundamental and Applied Sciences
*

*Finite*

*automata*over groups extend the possibilities of

*finite*

*automata*and allow studying the properties of groups using

*finite*

*automata*. ... In this paper, we consider

*finite*

*automata*over some Abelian groups ℤn and ℤn × ℤn. The relation of Cayley table to

*finite*

*automata*diagram is introduced in the paper. ... This group cannot be recognized by

*modified*deterministic

*finite*

*automata*. ...

##
###
Double Substring based Classification for Nondeterministic Finite Automata

2015
*
Indian Journal of Science and Technology
*

Application/Improvements: The categorization also applicable to regular expression, and Deterministic

doi:10.17485/ijst/2015/v8i26/87161
fatcat:o5s53pwo6jca5c553dadcxlssa
*Finite**Automata*(DFA). This concept can be used to design*modified*ticket vending machines 7 . ... Background/Objectives: To classify Nondeterministic*Finite**Automata*(NFA) using double substring. ... Introduction*Finite**Automata*(FA) has the design, which based on the string. It has two types, namely Nondeterministic*Finite**Automata*(NFA) and Deterministic*Finite**Automata*(DFA). ...##
###
Preface

2017
*
Natural Computing
*

It concerns formal language recognition by cellular

doi:10.1007/s11047-017-9615-4
fatcat:32c2ksyhtjcn7pcnsc25aptpaa
*automata*in real time, but the standard cellular*automata*model is*modified*to allow cells to disappear during the computation. ... It turns out that if the group contains an element of infinite order then already four*finite**automata*can define the same sets of configurations as any number of*finite**automata*, or in fact, as arbitrary ...##
###
Page 5 of Journal of Research and Practice in Information Technology Vol. 14, Issue 1
[page]

1982
*
Journal of Research and Practice in Information Technology
*

Their conversion to

*finite**automata*is described by Hopcroft and Ullman (1979, pp 45-46). ... The one by Kleene (1959) proves the equivalence of regular expressions and*finite**automata*. ...##
###
Page 2882 of Mathematical Reviews Vol. , Issue 84g
[page]

1984
*
Mathematical Reviews
*

A learning control system is also described which generates and

*modifies*the control algorithm on the basis of the*automata*model analysis and its behaviour during the control; this is a nontraditional ... We also indicate certain properties of*finitely*iterated Turing machines.” 68D*Automata*See also 08004, 08028, 60147, 68035, 68062, 68065, 94008. ...##
###
State space reconfigurability

2006
*
Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems - CASES '06
*

We propose to use

doi:10.1145/1176760.1176772
dblp:conf/cases/KeungT06
fatcat:ekx2todexzen7ga7s4upjfmegm
*self*-*modifying**finite**automata*(SMFA), that have been studied from complexity-theoretic perspective, for expressing and implementing such adaptive behaviors in embedded systems. ... The*self**modifying**finite**automata*(SMFA) offer an in-between solution. ...*SELF**MODIFYING**FINITE**AUTOMATA*SMFA*Self**modifying**finite**automata*(SMFA) [4] , [5] was introduced to explore the complexity hierarchy between regular and context-free languages (corresponding to ...##
###
Page 4568 of Mathematical Reviews Vol. , Issue 98G
[page]

1998
*
Mathematical Reviews
*

(ii) For the size (i.e., the number of states) of fi- nite

*automata*we show that the size of Las Vegas*finite**automata*recognizing a language L is at least the root of the size of the mini- mal deterministic ...*finite*automaton recognizing L. ...##
###
Chapter 15 Self-Regulating Automata
[chapter]

2014
*
Regulated Grammars and Automata
*

resulting from the

doi:10.1007/978-1-4939-0369-6_15
fatcat:regygyu7sfgtxgmyxe6rdusekm
*self*-regulating*finite**automata*. ... This paper introduces and discusses*self*-regulating*finite**automata*. In essence, these*automata*regulate the use of their rules by a sequence of rules applied during previous moves. ... n-Turn All-Move*Self*-Regulating*Finite**Automata*This section discusses n-turn all-move*self*-regulating*finite**automata*. ...##
###
Page 2569 of Mathematical Reviews Vol. 57, Issue 6
[page]

1979
*
Mathematical Reviews
*

Codd
[Cellular

*automata*, Academic Press, New York, 1968; RZMat 1970 #7 V592K] of a*self*-reproducing universal computer (SUC). ... 67 ee ee uch 169 ym- s in aton nput a set Oe —_ as 2569 consisting of a*finite*number of strings of*finite*length from such an acceptable or nonacceptable set of strings. ...##
###
A Note on Pushdown Automata Systems
[chapter]

2014
*
Lecture Notes in Computer Science
*

Another line of research

doi:10.1007/978-3-319-09704-6_30
fatcat:5x4ga4hkbjgu3prl3gyzutdwua
*modified*the definition of PCPA such that communication is asynchronous (Otto 2013). ... Then we turn our attention to Uniform Distributed Pushdown*Automata*Systems (UDPAS). These systems of*automata*work in turn on a single tape. ... We define A ′ and B ′ as*automata*having the*finite*controls of A and B with*self*-loops on # added to every state. ...##
###
Page 3135 of Mathematical Reviews Vol. 58, Issue 4
[page]

1979
*
Mathematical Reviews
*

Since

*finite**automata*are structures of this type the method presented yields a solution to the isomorphism problem of*finite**automata*.” {For the entire collection see MR 57 #18172.} ... The book is completely*self*-contained. *Astomatu. Bum. 2. (Russian) [*Automata*. No. 2] Edited by M. A. Spivak. Izdat. Saratov. Univ., Saratov, 1977. 60 pp. 0.45 r. ...##
###
Adaptive Finite State Automata and Genetic Algorithms: Merging Individual Adaptation and Population Evolution
[chapter]

2005
*
Adaptive and Natural Computing Algorithms
*

Adaptive

doi:10.1007/3-211-27389-1_80
fatcat:jz7jxnf6hjdebcrfhotemquz4y
*finite**automata*, which are basically*finite*state*automata*that can change their internal structures during operation, have proven to be an attractive way to represent simple learning strategies ... This paper presents adaptive*finite*state*automata*as an alternative formalism to model individuals in a genetic algorithm environment. ... Independently, Shutt and Rubstein introduced in [7], a similar device, called*Self*-*Modifying**Automata*[7] . ...##
###
Page 412 of Mathematical Reviews Vol. 24, Issue 6B
[page]

1962
*
Mathematical Reviews
*

The survey consists of eight sections; introduction,

*finite**automata*, probabilistic*automata*, behavioral descriptions, various concepts of growing*automata*, operations by*finite*and growing*automata*(real-time ... A procedure for optimizing linear servos is described in which the disturbances acting on the systems are*modified*by the addition of some of their derivatives. ...
« Previous

*Showing results 1 — 15 out of 12,163 results*