Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Modeling and analyzing finite state automata in the finite field F 2
Date
2004-06-29
Author
Reger, J.
Schmidt, Klaus Verner
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
210
views
0
downloads
Cite This
A method for determining multilinear state space models for general finite state automata is presented. The obtained model resides on F-2, the finite field of characteristic 2 with the operations addition and multiplication, both carried out modulo 2. It is functionally complete in the sense that it is capable of describing all finite state automata, including non-deterministic and partially defined automata. For those cases in which the model over F-2 is linear, means for a complete analysis of the cyclic behavior of these automata are recalled. With respect to these linear models, the cyclic structure of the state space is shown to be determined only by the periods of the elementary divisor polynomials of the system dynamics. An example illustrates the analysis procedure. (C) 2003 IMACS. Published by Elsevier B.V. All rights reserved.
Subject Keywords
Theoretical Computer Science
,
Modelling and Simulation
,
General Computer Science
,
Applied Mathematics
,
Numerical Analysis
URI
https://hdl.handle.net/11511/47277
Journal
Mathematics and Computers in Simulation
DOI
https://doi.org/10.1016/j.matcom.2003.11.005
Collections
Department of Electrical and Electronics Engineering, Article
Suggestions
OpenMETU
Core
A finite field framework for modeling, analysis and control of finite state automata
Reger, Johann; Schmidt, Klaus Verner (Informa UK Limited, 2004-09-01)
In this paper, we address the modeling, analysis and control of finite state automata, which represent a standard class of discrete event systems. As opposed to graph theoretical methods, we consider an algebraic framework that resides on the finite field F-2 which is defined on a set of two elements with the operations addition and multiplication, both carried out modulo 2. The key characteristic of the model is its functional completeness in the sense that it is capable of describing most of the finite st...
Modelling and Monte Carlo simulation of the atomic ordering processes in Ni3Al intermetallics
Mehrabov, Amdulla; Akdeniz, Mahmut Vedat (IOP Publishing, 2007-03-01)
The evolution of atomic ordering processes in Ni3Al has been modelled by a Monte Carlo ( MC) simulation method combined with the electronic theory of alloys in pseudopotential approximation. The magnitudes of atomic ordering energies of atomic pairs in the Ni3Al system have been calculated by means of electronic theory in pseudopotential approximation up to the 4th coordination spheres and subsequently used as input data for MC simulation for more detailed analysis for the first time. The Bragg - Williams l...
Non-autonomous equations with unpredictable solutions
Akhmet, Marat (Elsevier BV, 2018-06-01)
To make research of chaos more amenable to investigating differential and discrete equations, we introduce the concepts of an unpredictable function and sequence. The topology of uniform convergence on compact sets is applied to define unpredictable functions [1,2]. The unpredictable sequence is defined as a specific unpredictable function on the set of integers. The definitions are convenient to be verified as solutions of differential and discrete equations. The topology is metrizable and easy for applica...
A quasi-incompressible and quasi-inextensible element formulation for transversely isotropic materials
Dal, Hüsnü (Wiley, 2019-01-06)
The contribution presents a new finite element formulation for quasi-inextensible and quasi-incompressible finite hyperelastic behavior of transeversely isotropic materials and addresses its computational aspects. The material formulation is presented in purely Eulerian setting and based on the additive decomposition of the free energy function into isotropic and anisotropic parts, where the former is further decomposed into isochoric and volumetric parts. For the quasi-incompressible response, the Q1P0 ele...
Domain-Structured Chaos in a Hopfield Neural Network
Akhmet, Marat (World Scientific Pub Co Pte Lt, 2019-12-30)
In this paper, we provide a new method for constructing chaotic Hopfield neural networks. Our approach is based on structuring the domain to form a special set through the discrete evolution of the network state variables. In the chaotic regime, the formed set is invariant under the system governing the dynamics of the neural network. The approach can be viewed as an extension of the unimodality technique for one-dimensional map, thereby generating chaos from higher-dimensional systems. We show that the dis...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
J. Reger and K. V. Schmidt, “Modeling and analyzing finite state automata in the finite field F 2,”
Mathematics and Computers in Simulation
, pp. 193–206, 2004, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/47277.