scholarly journals The word and order problems for self-similar and automata groups

2020 ◽  
Vol 14 (2) ◽  
pp. 705-728
Author(s):  
Laurent Bartholdi ◽  
Ivan Mitrofanov
Keyword(s):  
Automata Groups ◽  
Self Similar

scholarly journals Groups and semigroups defined by colorings of synchronizing automata

2014 ◽  
Vol 24 (06) ◽  
pp. 773-793 ◽  
Author(s):  
Daniele D'Angeli ◽  
Emanuele Rodaro
Keyword(s):  
Finite Automata ◽  
Deterministic Finite Automata ◽  
Combinatorial Properties ◽  
Automata Groups ◽  
Synchronizing Automata ◽  
Algebraic Properties ◽  
Mealy Automata ◽  
Group A ◽  
Free Semigroups ◽  
Self Similar

In this paper we combine the algebraic properties of Mealy machines generating self-similar groups and the combinatorial properties of the corresponding deterministic finite automata (DFA). In particular, we relate bounded automata to finitely generated synchronizing automata and characterize finite automata groups in terms of nilpotency of the corresponding DFA. Moreover, we present a decidable sufficient condition to have free semigroups in an automaton group. A series of examples and applications is widely discussed, in particular we show a way to color the de Bruijn automata into Mealy automata whose associated semigroups are free, and we present some structural results related to the associated groups.

Self-similar collapse with non-radial motions

2006 ◽  
Vol 20 ◽  
pp. 1-4
Author(s):  
A. Nusser
Keyword(s):  
Self Similar

PREDICTING CHARACTERISTICS OF SELF SIMILAR TRAFFIC BY SPLINE-EXTRAPOLATION

2019 ◽  
Author(s):  
Irina Strelkovskay ◽  
Irina Solovskaya ◽  
Anastasija Makoganjuk ◽  
Nikolaj Severin
Keyword(s):  
Quality Characteristics ◽  
Traffic Prediction ◽  
Normative Values ◽  
Spline Functions ◽  
Network Nodes ◽  
Traffic Forecasting ◽  
Network Equipment ◽  
Self Similar ◽  
Accuracy Of Prediction

The problem of forecasting self-similar traffic, which is characterized by a considerable number of ripples and the property of long-term dependence, is considered. It is proposed to use the method of spline extrapolation using linear and cubic splines. The results of self-similar traffic prediction were obtained, which will allow to predict the necessary size of the buffer devices of the network nodes in order to avoid congestion in the network and exceed the normative values ​​of QoS quality characteristics. The solution of the problem of self-similar traffic forecasting obtained with the Simulink software package in Matlab environment is considered. A method of extrapolation based on spline functions is developed. The proposed method has several advantages over the known methods, first of all, it is sufficient ease of implementation, low resource intensity and accuracy of prediction, which can be enhanced by the use of quadratic or cubic interpolation spline functions. Using the method of spline extrapolation, the results of self-similar traffic prediction were obtained, which will allow to predict the required volume of buffer devices, thereby avoiding network congestion and exceeding the normative values ​​of QoS quality characteristics. Given that self-similar traffic is characterized by the presence of "bursts" and a long-term dependence between the moments of receipt of applications in this study, given predetermined data to improve the prediction accuracy, it is possible to use extrapolation based on wavelet functions, the so-called wavelet-extrapolation method. Based on the results of traffic forecasting, taking into account the maximum values ​​of network node traffic, you can give practical guidance on how traffic is redistributed across the network. This will balance the load of network objects and increase the efficiency of network equipment.

Self-similar traffic discrimination and generating methods based on fractal Brown motion

2013 ◽  
Vol 33 (4) ◽  
pp. 947-949
Author(s):  
Xueyuan ZHANG ◽  
Yonggang WANG ◽  
Qiong ZHANG
Keyword(s):  
Self Similar ◽  
Brown Motion
Sign in / Sign up

Export Citation Format

Share Document