Let (Σ, h) be a DOL scheme where h is a homomorphism from Σ* to Σ*. (Σ, h) is said to completely simulate another DOL scheme (Δ, g) if hf = fg and hn = fr} for some injective homomorphism f, some positive integer n, and some homomorphism r. The main results of this paper are: (1) Each complete simulation can be decomposed into a series of “primitive” simulations. (2) It is decidable whether or not there exists a standard locally catenative scheme which is simulated by a given DOL scheme
This paper examines the concept of simulation from a modelling viewpoint. How can one Mealy machine ...
AbstractThis paper continues the research on elementary D0L systems. In particular we provide an alt...
Kleisli simulation is a categorical notion introduced by Hasuo to verifyfinite trace inclusion. They...
Let (Σ, h) be a DOL scheme where h is a homomorphism from Σ* to Σ*. (Σ, h) is said to completely sim...
The notion of a simplification of a homomorphism is introduced and investigated. Its usefulness is d...
AbstractWe have investigated the simulation problem of DIL schemes to evaluate the strength of their...
The notion of a simplification of a homomorphism is introduced and investigated. Its usefulness is d...
AbstractA standard locally catenative L scheme extracts the essential feature of the locally catenat...
AbstractA standard locally catenative L scheme extracts the essential feature of the locally catenat...
The language and sequence equivalence problem for DOL-systems is shown to be decidable. In an algebr...
AbstractThis paper continues the research on elementary D0L systems. In particular we provide an alt...
The language and sequence equivalence problem for DOL-systems is shown to be decidable. In an algebr...
We present a uniform approach for proving the polynomial time decidability of various simulation and...
Abstract. The technique of forward/backward simulations has been applied successfuly in many distrib...
AbstractTo better understand the relationships between different models of parallel computation, we ...
This paper examines the concept of simulation from a modelling viewpoint. How can one Mealy machine ...
AbstractThis paper continues the research on elementary D0L systems. In particular we provide an alt...
Kleisli simulation is a categorical notion introduced by Hasuo to verifyfinite trace inclusion. They...
Let (Σ, h) be a DOL scheme where h is a homomorphism from Σ* to Σ*. (Σ, h) is said to completely sim...
The notion of a simplification of a homomorphism is introduced and investigated. Its usefulness is d...
AbstractWe have investigated the simulation problem of DIL schemes to evaluate the strength of their...
The notion of a simplification of a homomorphism is introduced and investigated. Its usefulness is d...
AbstractA standard locally catenative L scheme extracts the essential feature of the locally catenat...
AbstractA standard locally catenative L scheme extracts the essential feature of the locally catenat...
The language and sequence equivalence problem for DOL-systems is shown to be decidable. In an algebr...
AbstractThis paper continues the research on elementary D0L systems. In particular we provide an alt...
The language and sequence equivalence problem for DOL-systems is shown to be decidable. In an algebr...
We present a uniform approach for proving the polynomial time decidability of various simulation and...
Abstract. The technique of forward/backward simulations has been applied successfuly in many distrib...
AbstractTo better understand the relationships between different models of parallel computation, we ...
This paper examines the concept of simulation from a modelling viewpoint. How can one Mealy machine ...
AbstractThis paper continues the research on elementary D0L systems. In particular we provide an alt...
Kleisli simulation is a categorical notion introduced by Hasuo to verifyfinite trace inclusion. They...