AbstractPeriodic D0L systems and languages are defined, and periodicity is shown to be a decidable property of D0L systems. The fundamental tools used are recent results on the representation of stationary ω-words (Head and Lando, 1986) and the decidability of ultimate periodicity of ω-words (Harju and Linna, 1986; Pansiot, 1986). The relation of D0L periodicity to local catenativity and to n-codes is examined
In the first part of the talk, I will overview some results on state complexity of ultimately period...
Recently, several high dimensional dictionary representations were proposed for discrete time period...
AbstractWe have recently proved that there is a bound for the sequence equivalence problem of polyno...
AbstractA unified presentation of periodicity and ultimate periodicity of D0L systems is given. Boun...
AbstractFor an alphabet A and a morphism h: A∗ → A∗, the set of words w such that the D0L-system (A,...
We give a new proof for the decidability of the D0L ultimate periodicity problem based on the decida...
A subclass of regular languages called periodic languages and the corresponding finite automata havi...
The following result is established: Let L be a DOL language and x1, x2,…, a sequence of all words i...
In this paper, we develop a theory of regular ω-languages that consist of ultimately periodic words ...
AbstractThe definitions of a piecewise deterministic zero Lindenmayer (PWD0L) scheme and system are ...
A HD0L system is a 5-tuple G = (∆, Γ, f, g, w) where • ∆ and Γ are alphabet; • f : ∆^∗ → ∆^∗ is a ...
Languages and Automata with an Application to Time Granularity Abstract In this paper, we develop a ...
AbstractIn this note we prove two cancellation properties of iterated morphisms and use these proper...
International audienceWe introduce a new relationship between formal language theory and surface the...
AbstractThis paper proves the decidability of several problems in the theory of HD0L, D0L and PD0L s...
In the first part of the talk, I will overview some results on state complexity of ultimately period...
Recently, several high dimensional dictionary representations were proposed for discrete time period...
AbstractWe have recently proved that there is a bound for the sequence equivalence problem of polyno...
AbstractA unified presentation of periodicity and ultimate periodicity of D0L systems is given. Boun...
AbstractFor an alphabet A and a morphism h: A∗ → A∗, the set of words w such that the D0L-system (A,...
We give a new proof for the decidability of the D0L ultimate periodicity problem based on the decida...
A subclass of regular languages called periodic languages and the corresponding finite automata havi...
The following result is established: Let L be a DOL language and x1, x2,…, a sequence of all words i...
In this paper, we develop a theory of regular ω-languages that consist of ultimately periodic words ...
AbstractThe definitions of a piecewise deterministic zero Lindenmayer (PWD0L) scheme and system are ...
A HD0L system is a 5-tuple G = (∆, Γ, f, g, w) where • ∆ and Γ are alphabet; • f : ∆^∗ → ∆^∗ is a ...
Languages and Automata with an Application to Time Granularity Abstract In this paper, we develop a ...
AbstractIn this note we prove two cancellation properties of iterated morphisms and use these proper...
International audienceWe introduce a new relationship between formal language theory and surface the...
AbstractThis paper proves the decidability of several problems in the theory of HD0L, D0L and PD0L s...
In the first part of the talk, I will overview some results on state complexity of ultimately period...
Recently, several high dimensional dictionary representations were proposed for discrete time period...
AbstractWe have recently proved that there is a bound for the sequence equivalence problem of polyno...
DOI
Add to ORKG