Spelling suggestions: "subject:"equential machine theory"" "subject:"aequential machine theory""
21 |
Le codage des états à l'aide des recouvrements de codage /Paquet, Jean-Paul January 1976 (has links)
No description available.
|
22 |
Maximal memory binary input-binary output sequential machines /Newborn, Monroe January 1967 (has links)
No description available.
|
23 |
Grammatical inference of regular and context-free languages /Marik, Delores Ann January 1977 (has links)
No description available.
|
24 |
Random generation of finite automata over the domain of the regular languagesRaitt, Lesley Anne 12 1900 (has links)
Thesis (MSc)--University of Stellenbosch, 2007. / ENGLISH ABSTRACT: The random generation of finite automata over the domain of their graph structures is a wellknown
problem. However, random generation of finite automata over the domain of the regular
languages has not been studied in such detail. Random generation algorithms designed for this
domain would be useful for the investigation of the properties of the regular languages associated
with the finite automata.
We studied the existing enumerations and algorithms to randomly generate UDFAs and binary
DFAs as they pertained to the domain of the regular languages. We evaluated the algorithms
experimentally across the domain of the regular languages for small values of n and found the distributions
non-uniform. Therefore, for UDFAs, we derived an algorithm for the random generation
of UDFAs over the domain of the regular languages from Domaratzki et. al.’s [9] enumeration of
the domain of the regular languages. Furthermore, for binary DFAs, we concluded that for large
values of n, the bijection method is a viable means of randomly generating binary DFAs over the
domain of the regular langagues.
We looked at all the random generation of union-UNFAs and -UNFAs across the domain of
the regular languages. Our study of these UNFAs took all possible variables for the generation of
UNFAs into account. The random generation of UNFAs over the domain of the regular languages
is an open problem / AFRIKAANSE OPSOMMING: Die ewekansige generasie van eindige toestand outomate (eto’s) oor die domein van hul grafiekstrukture
is ’n bekende probleem. Nieteenstaande het die ewekansige generasie van eindige toestand
outomate oor die domein van die regulˆere tale nie soveel aandag gekry nie. Algoritmes wat eindige
toestand outomate ewekansig genereer oor die domein van die regulˆere tale sal nuttig wees om die
ondersoek van die eienskappe van regulˆere tale, wat met eto’s verbind is, te bewerkstellig.
Ons het die bestaande aftellings en algoritmes bestudeer vir die ewekansige generasie van deterministiese
eindige toestand outomate (deto’s) met een en twee alfabetiese simbole soos dit betrekking
het op die domein van die regulˆere tale bestudeer. Ons het die algoritmes eksperimenteel beoordeel
oor die domein van die regulˆere tale vir outomate met min toestande en bevind dat die
verspreiding nie eenvomig is nie. Daarom het ons ’n algoritme afgelei vir die ewekansige generasie
van deto’s met een alfabetsimbool oor die domein van die regulˆere tale van Domaratzki et. al. [9]
se aftelling. Bowendien, in die geval van deto’s met twee alfabetsimbole met ’n groot hoeveelheid
toestande is die ‘bijeksie metode ’n goeie algoritme om te gebruik vir die ewekansige generasie van
hierdie deto’s oor die domein van die regulˆere tale.
Ons het ook die ewekansige generasie van [-nie-deterministiese eindige toestand outomate en
-nie-deterministiese eindige toestand outomate oor die domein van die regulˆere tale bestudeer.
Ons studie van hierdie neto’s het alle moontlike veranderlikes in ageneem. Die ewekansige generering
van deto’s oor die domein van die regulˆere tale is ’n ope probleem.
|
25 |
Environment modeling and efficient state reachability checking /Raimi, Richard Saul. January 1999 (has links)
Thesis (Ph. D.)--University of Texas at Austin, 1999. / Vita. Includes bibliographical references (leaves 195-204). Available also in a digital version from Dissertation Abstracts.
|
26 |
SFILE - Extraction and listing from sequential filesVaris, Aminul Syed January 1974 (has links)
No description available.
|
27 |
Hypercube machine implementation of low-level vision algorithmsLim, Choon Kee. January 1989 (has links)
Thesis (M.S.)--Ohio University, August, 1988. / Title from PDF t.p.
|
28 |
A linear algebra approach to synchronizing automata /Arnold, Fredrick C., January 1900 (has links)
Thesis (M. Sc.)--Carleton University, 2005. / Includes bibliographical references (p. 47-48). Also available in electronic format on the Internet.
|
29 |
Visual robot guidance in time-varying environment using quadtree data structure and parallel processingBohora, Anil R. January 1989 (has links)
Thesis (M.S.)--Ohio University, June, 1989. / Title from PDF t.p.
|
30 |
Algorithms for parallel and sequential matrix-chain product problemWang, Ting. January 1997 (has links)
Thesis (M.S.)--Ohio University, November, 1997. / Title from PDF t.p.
|
Page generated in 0.0911 seconds