Some algorithms on the star operation applied to finite languages.
Some algorithms to compute the conjugates of episturmian morphisms
Episturmian morphisms generalize sturmian morphisms. They are defined as compositions of exchange morphisms and two particular morphisms , and . Epistandard morphisms are the morphisms obtained without considering . In [14], a general study of these morphims and of conjugacy of morphisms is given. Here, given a decomposition of an Episturmian morphism over exchange morphisms and , we consider two problems: how to compute a decomposition of one conjugate of ; how to compute a list of decompositions...
Some algorithms to compute the conjugates of Episturmian morphisms
Episturmian morphisms generalize Sturmian morphisms. They are defined as compositions of exchange morphisms and two particular morphisms L, and R. Epistandard morphisms are the morphisms obtained without considering R. In [14], a general study of these morphims and of conjugacy of morphisms is given. Here, given a decomposition of an Episturmian morphism f over exchange morphisms and {L,R}, we consider two problems: how to compute a decomposition of one conjugate of f; how to compute a...
Some applications of parabolic differential equations of Allen-Cahn type in image processing
Some arithmetical theorems on base conversions
Some aspects of balking and reneging in finite buffer queues
In this paper, a single server finite buffer Markovian queuing system is analyzed with the additional restriction that customers may balk as well as renege. Reneging considered in literature is usually of position independent type where the reneging rate is constant irrespective of the position of the customer in the system. However there are many real world situations where this assumption does not hold. This paper is an attempt to model balking with position dependent reneging. Explicit closed...
Some aspects of balking and reneging in finite buffer queues
In this paper, a single server finite buffer Markovian queuing system is analyzed with the additional restriction that customers may balk as well as renege. Reneging considered in literature is usually of position independent type where the reneging rate is constant irrespective of the position of the customer in the system. However there are many real world situations where this assumption does not hold. This paper is an attempt to model balking with position dependent reneging. Explicit closed...
Some Characteristics of the Process Measure of the Amount of Information
Some closure properties of the nondeterministic regular translations.
Some combinatorial properties of complete semi-Thue systems.
Some consequences of a result of Ehrenfeucht and Rozenberg
Some decision problems on integer matrices
Given a finite set of matrices with integer entries, consider the question of determining whether the semigroup they generated 1) is free; 2) contains the identity matrix; 3) contains the null matrix or 4) is a group. Even for matrices of dimension , questions 1) and 3) are undecidable. For dimension , they are still open as far as we know. Here we prove that problems 2) and 4) are decidable by proving more generally that it is recursively decidable whether or not a given non singular matrix belongs...
Some decision problems on integer matrices
Given a finite set of matrices with integer entries, consider the question of determining whether the semigroup they generated 1) is free; 2) contains the identity matrix; 3) contains the null matrix or 4) is a group. Even for matrices of dimension 3, questions 1) and 3) are undecidable. For dimension 2, they are still open as far as we know. Here we prove that problems 2) and 4) are decidable by proving more generally that it is recursively decidable whether or not a given non singular matrix belongs...
Some facts related to the papers by L. V. Kantorovich reproduced in this issue.
Some fundamental notions of large variable systems
Some further remarks on the family of finite index matrix languages
Some further remarks on the index of context-free languages
Some geometric perspectives in concurrency theory.
Some graphic uses of an even number of odd nodes
Vertex-degree parity in large implicit “exchange graphs” implies some EP theorems asserting the existence of a second object without evidently providing a polytime algorithm for finding a second object.
Some hardness results for question/answer games.