Selfgenerating sequences and different types of computational devices [Abstract of thesis]
Page 1
Jana Kršňáková (1989)
Commentationes Mathematicae Universitatis Carolinae
M. Clerbout, Y. Roos, I. Ryl (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
M. Clerbout, Y. Roos, I. Ryl (2010)
RAIRO - Theoretical Informatics and Applications
The aim of this paper is to show that a semi-commutation function can be expressed as the compound of a sequential transformation, a partial commutation function, and the reverse transformation. Moreover, we give a necessary and sufficient condition for the image of a regular language to be computed by the compound of two sequential functions and a partial commutation function.
Goubault, Eric (2003)
Homology, Homotopy and Applications
Karel Klouda, Zuzana Masáková, Radko Mesiar, Martin Štěpnička (2012)
Kybernetika
Christoforos N. Hadjicostis, George C. Verghese (1999)
Kybernetika
The design and implementation of systems in state form has traditionally focused on minimal representations which require the least number of state variables. However, “structured redundancy” – redundancy that has been intentionally introduced in some systematic way – can be extremely important when fault tolerance is desired. The redundancy can be used to detect and correct errors or to guarantee desirable performance despite hardware or computational failures. Modular redundancy, the traditional...
Aydin Aybar, Altuğ İftar (2012)
Kybernetika
Supervisory controller design to avoid deadlock in discrete-event systems modeled by timed-place Petri nets (TPPNs) is considered. The recently introduced approach of place-stretching is utilized for this purpose. In this approach, given an original TPPN (OPN), a new TPPN, called the place-stretched Petri net (PSPN), is obtained. The PSPN has the property that its marking vector is sufficient to represent its state. By using this property, a supervisory controller design approach for TPPNs to avoid...
Page 1