Relevant bibliographies by topics / Mealy and Moore automata convolution

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Mealy and Moore automata convolution'

Author: Grafiati
Published: 4 June 2021
Last updated: 13 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Mealy and Moore automata convolution.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Mealy and Moore automata convolution"

1

Žvironienė, Aušra, Zenonas Navickas, and Ramutis Rindzevičius. "THE IMITATION MODEL OF BURSTY AND BATCH DATA PACKET FLOW." Technological and Economic Development of Economy 12, no. 4 (December 31, 2006): 360–66. http://dx.doi.org/10.3846/13928619.2006.9637767.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Cakir, Merve Nur, Mehwish Saleemi, and Karl-Heinz Zimmermann. "Cascade Products of Stochastic Automata." WSEAS TRANSACTIONS ON COMPUTERS 20 (August 2, 2021): 168–75. http://dx.doi.org/10.37394/23205.2021.20.17.

Full text
Abstract:
Stochastic Moore automata have in opposition to stochastic Mealy automata the same capabilities as general stochastic automata, but have the advantage that they are easier to access than their pure stochastic counterparts. Cascade decomposition of automata leads to a loop-free partitioning and in this way contributes to the analysis of automata. This paper shows that stochastic Moore automata can be decomposed into cascade products of stochastic Moore automata under mild conditions
APA, Harvard, Vancouver, ISO, and other styles
3

Oezguel, Mustafa, Florian Deeg, and Sebastian M. Sattler. "Mealy-to-Moore Transformation – A state stable design of automata." Advances in Science, Technology and Engineering Systems Journal 2, no. 6 (December 2017): 162–74. http://dx.doi.org/10.25046/aj020621.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Esmoris, Agustín, Carlos Iván Chesñevar, and Maráa Paula González. "TAGS: A Software Tool for Simulating Transducer Automata." International Journal of Electrical Engineering & Education 42, no. 4 (October 2005): 338–49. http://dx.doi.org/10.7227/ijeee.42.4.5.

Full text
Abstract:
This paper introduces TAGS (Transducer Automata Graphical Simulator), a software tool for teaching different aspects of transducer automata theory, a theoretical topic which underlies many aspects of the design of sequential digital circuits. TAGS allows simulation of both Moore and Mealy transducer automata, integrating different theoretical concepts associated with them. The student can define an arbitrary transducer automaton in an interactive way, being able to simulate and trace its behavior by means of different ‘views’.
APA, Harvard, Vancouver, ISO, and other styles
5

PEDRYCZ, WITOLD, and ADAM GACEK. "LEARNING OF FUZZY AUTOMATA." International Journal of Computational Intelligence and Applications 01, no. 01 (March 2001): 19–33. http://dx.doi.org/10.1142/s1469026801000068.

Full text
Abstract:
In this study, we revisit the well-known notion of fuzzy state machines and discuss their development through learning. The systematic development of fuzzy state machines has not been pursued as intensively as it could have been expected from the breadth of the possible usage of them as various modelling platforms. We concentrate on the generalization of the well known architectures exploited in Boolean system synthesis, namely Moore and Mealy machines and show how these can be implemented in terms of generic functional modules such as fuzzy JK flip-flops and fuzzy logic neurons (AND and OR neurons) organized in the form of logic processors. It is shown that the design of the fuzzy state machines can be accomplished through their learning. The detailed learning algorithm is presented and illustrated with a series of numeric examples. The study reveals an interesting option of constructing digital systems through learning: the original problem is solved in the setting of fuzzy state machines and afterwards "binarised" into the two-valued format realized via the standard digital hardware.
APA, Harvard, Vancouver, ISO, and other styles
6

BRZOZOWSKI, JANUSZ, and HELMUT JÜRGENSEN. "REPRESENTATION OF SEMIAUTOMATA BY CANONICAL WORDS AND EQUIVALENCES, PART II: SPECIFICATION OF SOFTWARE MODULES." International Journal of Foundations of Computer Science 18, no. 05 (October 2007): 1065–87. http://dx.doi.org/10.1142/s0129054107005133.

Full text
Abstract:
A theory of representation of semiautomata by canonical words and equivalences was developed in [7]. That work was motivated by trace-assertion specifications of software modules, but its focus was entirely on the underlying mathematical model. In the present paper we extend that theory to automata with Moore and Mealy outputs, and show how to apply the extended theory to the specification of modules. In particular, we present a unified view of the trace-assertion methodology, as guided by our theory. We illustrate this approach, and some specific issues, using several nontrivial examples. We include a discussion of finite versus infinite modules, methods of error handling, some awkward features of the trace-assertion method, and a comparison to specifications by automata. While specifications by trace assertions and automata are equivalent in power, there are cases where one approach appears to be more natural than the other. We conclude that, for certain types of system modules, formal specification by automata, as opposed to informal state machines, is not only possible, but practical.
APA, Harvard, Vancouver, ISO, and other styles
7

WATSON, BRUCE W. "Implementing and using finite automata toolkits." Natural Language Engineering 2, no. 4 (December 1996): 295–302. http://dx.doi.org/10.1017/s135132499700154x.

Full text
Abstract:
Finite automata and various extensions of them, such as transducers, are used in areas as diverse as compilers, spelling checking, natural language grammar checking, communication protocol design, digital circuit simulation, digital flight control, speech recognition and synthesis, genetic sequencing, and Java program verification. Unfortunately, as the number of applications has grown, so has the variety of implementations and implementation techniques. Typically, programmers will be confused enough to resort to their text books for the most elementary algorithms. Recently, advances have been made in taxonomizing algorithms for constructing and minimizing automata and in evaluating various implementation strategies Watson 1995. Armed with this, a number of general-purpose toolkits have been developed at universities and companies. One of these, FIRE Lite, was developed at the Eindhoven University of Technology, while its commercial successor, FIRE Engine II, has been developed at Ribbit Software Systems Inc. Both of these toolkits provide implementations of all of the known algorithms for constructing automata from regular expressions, and all of the known algorithms for minimizing deterministic finite automata. While the two toolkits have a great deal in common, we will concentrate on the structure and use of the noncommercial FIRE Lite. The prototype version of FIRE Lite was designed with compilers in mind. More recently, computation linguists and communications protocol designers have become interested in using the toolkit. This has led to the development of a much more general interface to FIRE Lite, including the support of both Mealy and Moore regular transducers. While such a toolkit may appear extremely complex, there are only a few choices to be made. We also consider a ‘recipe’ for making good use of the toolkits. Lastly, we consider the future of FIRE Lite. While FIRE Engine II has obvious commercial value, we are committed to maintaining a version which is freely available for academic use.
APA, Harvard, Vancouver, ISO, and other styles
8

MILLERIOUX, G., and P. GUILLOT. "SELF-SYNCHRONIZING STREAM CIPHERS AND DYNAMICAL SYSTEMS: STATE OF THE ART AND OPEN ISSUES." International Journal of Bifurcation and Chaos 20, no. 09 (September 2010): 2979–91. http://dx.doi.org/10.1142/s0218127410027532.

Full text
Abstract:
Dynamical systems play a central role in the design of symmetric cryptosystems. Their use has been widely investigated both in "chaos-based" private communications and in stream ciphers over finite fields. In the former case, they take the form of automata named Moore or Mealy machines. The main charateristic of stream ciphers lies in that they require synchronization of complex sequences generated by the dynamical systems involved both at the transmitter and the receiver ends. In this paper, we focus on a special class of symmetric ciphers, namely the Self-Synchronizing Stream Ciphers. Indeed, such ciphers have not been seriously explored so far although they show interesting properties of synchronization which could make them very appealing in practice. We review and compare different design approaches which have been proposed in the open literature, and fully-specified algorithms are detailed for illustration purposes. Open issues related to the validation and the implementation of Self-Synchronizing Stream Ciphers are developed. We highlight the reason why some concepts borrowed from control theory appear to be useful to this end.
APA, Harvard, Vancouver, ISO, and other styles
9

Barkalov, A. A., L. A. Titarenko, Y. E. Vizor, and A. V. Matvienko. "Synthesis of a combined automaton with ASIC." Cybernetics and Computer Technologies, no. 2 (July 24, 2020): 78–85. http://dx.doi.org/10.34229/2707-451x.20.2.8.

Full text
Abstract:
Introduction. The model of a finite state machine is widely used for describing behavior of different sequential blocks, such as control units. It is possible that control units possess output signals having both types of Mealy and Moore automata. A model of the combined automaton can be used to synthesize such devices. When the automaton circuit is implemented, it is necessary to optimize its characteristics such as hardware amount. The methods of this task solution depend significantly on logic elements used to implement circuits. In this article, we propose a method of reducing hardware in the circuit of combined automaton implemented with ASIC. In this case, the circuit is implemented using customized matrix circuits. The proposed method allows reducing the chip area occupied by the circuit of the automaton. The method is based on the expansion of the matrix that generates circuit product terms of the systems of input memory functions and output functions of the combined automaton. The additional part of the matrix generates terms for output functions of Moore automaton. It allows reduction of the chip area as compared to the area of the two-level circuit of the combined automaton. The purpose of the article is to show that the division of circuit matrices allows reducing the resulting matrix area. The hardware amount is estimated for both trivial automaton structure and for the proposed approach. They are determined in conventional units of area. Results. The method is proposed based on the expansion of the matrix of terms. Using an example, it is shown how to execute the steps of the proposed method. To increase the method efficiency, it is proposed to use a special state assignment that minimizes the number of terms in the systems of Boolean functions of outputs with Moore type. The conducted investigations show that the proposed method allows for reducing the resulting ASIC area from 10% to 26%. The gain increases with the growth of the automaton complexity. Conclusions. A comparison of the proposed method with some known synthesis methods shows that the expansion of the matrix of terms for systems of input memory functions and output functions allows reducing the chip area occupied by the circuit of the combined automaton. Keywords: combined automaton, ASIC, synthesis, state encoding, matrix circuit.
APA, Harvard, Vancouver, ISO, and other styles
10

Korsakas, Stasys, Alfonsas Vainoras, Liudas Gargasas, Vytenis Miškinis, Rimtautas Ruseckas, Vidmantas Jurkonis, Algė Vitartaitė, and Jonas Poderys. "On-Line and Off-Line ECG and Motion Activity Monitoring System for Athletes." Baltic Journal of Sport and Health Sciences 3, no. 66 (November 5, 2018). http://dx.doi.org/10.33607/bjshs.v3i66.547.

Full text
Abstract:
The aim of this paper is to present a new ECG and motion activity monitoring and on-line analysis system for athle-tes. The developed system is intended to facilitate the coach in optimizing and individualizing the training of elite athletes.The hardware system consists of the device for registration of ECG and accelerometer signals and wireless trans-mission to computer. The coach software works in two modes: on-line version is used during training and off-line version is designed for detailed data analysis after training. The new method for respiration frequency evaluation was developed and checked on 28 persons, and in most cases the developed algorithm correctly evaluated the respiration frequency of the investigated persons. The evaluation of athlete’s functional state from calculated and measured pa-rameters and formation of warning signals (green — normal state, yellow — limitary state and red — premonitory state) is based on the analysis applying Moore and Mealy automata algorithms. The software for the evaluation of the patient’s activity was tested on 11 healthy students: the increase in physical activity level during the brisk walk was 1.4 times higher compared to the level during the slow walk, and during the jogging sessions it was 1.89 times higher than during the slow walk.The results obtained during the investigations show that the developed ECG and motion activity monitoring system with two packages of software allows to measure cardio respiratory changes and changes in intensities of physical activity under daily conditions. The comprehensive off-line analysis by monitoring data provides the possibility for coaches to make more detailed analysis of cardio respiratory changes and changes in intensities during training.Keywords: monitoring system for athletes, electrocardiogram, accelerometry, respiration frequency.
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Mealy and Moore automata convolution"

1

Berškienė, Kristina. "Informacinės posistemės, aprašančios individualizuotą žmogaus fiziologinį modelį fizinio krūvio metu, kūrimas." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2005. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2005~D_20050608_172734-17840.

Full text
Abstract:
The statistics claim, that people who are not physically active live shorter and they are ill more often. Only an individual physical activity is useful. For choosing the right activity the doctors have to investigate the patient, analyse and store his data for the future.The aim of this work was to describe mathematically the integral estimation model, using the model of physical load effect. We created the information subsystem of human functional state model for individual person using the convolution of Meally and Moore automata. The result is the applied program for the consumer – physiologist. This subsystem can be used in e – health for modeling the virtual doctor.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Mealy and Moore automata convolution"

1

Giunti, Marco. "Mathematical Dynamical Systems and Computational Systems." In Computation, Dynamics, and Cognition. Oxford University Press, 1997. http://dx.doi.org/10.1093/oso/9780195090093.003.0005.

Full text
Abstract:
The main thesis of this chapter is that a dynamical viewpoint allows us to better understand some important foundational issues of computation theory. Effective procedures are traditionally studied from two different but complementary points of view. The first approach is concerned with individuating those numeric functions that are effectively calculable. This approach reached its systematization with the theory of the recursive functions (Gödel, Church Kleene).This theory is not directly concerned with computing devices or computations. Rather, the effective calculability of a recursive function is guaranteed by the algorithmic nature of its definition. In contrast, the second approach focuses on a family of abstract mechanisms, which are then typically used to compute or recognize numeric functions, sets of numbers, or numbers. These devices can be divided into two broad categories: automata or machines (Turing and Post), and systems of rules for symbol manipulation (Post). The mechanisms that have been studied include: a. Automata or Machines 1. gate-nets and McCulloch-Pitts nets 2. finite automata (Mealy and Moore machines) 3. push-down automata 4. stack automata 5. Turing machines 6. register machines 7. wang machines 8. cellular automata b. Systems of Rules 9. monogenic production systems in general 10. monogenic Post canonical systems 11. monogenic Post normal systems 12. tag systems. I call any device studied by computation theory a computational system. Computation theory is traditionally interested in studying the relations between each type of computational system and the others, and in establishing what class of numeric functions each type can compute. Accordingly one proves two kinds of theorem: (1) that systems of a given type emulate systems of another type (examples: Turing machines emulate register machines and cellular automata; cellular automata emulate Turing machines, etc.), and (2) that a certain type of system is complete relative to the class of the (partial) recursive functions or, in other words, that this type of system can compute all and only the (partial) recursive functions (examples of complete systems: Turing machines, register machines, cellular automata, tag systems, etc.). All different types of computational systems have much in common. Nevertheless, it is not at all clear exactly which properties these mechanisms share.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Mealy and Moore automata convolution"

1

Davydov, Andrey, Dmitry Sokolov, Fedor Tsarev, and Anatoly Shalyto. "Application of Genetic Algorithms for Construction of Moore Automaton and Systems of Interacting Mealy Automata in "Artificial Ant" Problem." In Spring/Summer Young Researchers' Colloquium on Software Engineering. Institute for System Programming of the Russian Academy of Sciences, 2008. http://dx.doi.org/10.15514/syrcose-2008-2-10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography