AbstractWe study a generalization of DT0L systems obtained by considering noncommutative polynomials together with mappings attaching a morphism to each variable. We call the least fixed points of such pairs generalized DT0L languages and study their basic properties
This paper considers equality languages and fixed-point languages of homomorphisms and deterministic...
AbstractWe provide a new algebraic grammar for generalized Dyck languages as introduced by Labelle a...
AbstractA OL system is called a quasi-deterministic OL system or a D'OL system for short if there is...
AbstractRestricted versions of DT0L systems, so-called commutative DT0L systems, are considered. In ...
We review the rudiments of the equational logic of (least) fixed points and provide some of its appl...
AbstractThe paper investigates infinite words, and sets of them, associated with DOL and DTOL system...
AbstractWe show that for several classes of idempotent semirings the least fixed-point of a polynomi...
AbstractWe study bispecial factors in fixed points of morphisms. In particular, we propose a simple ...
AbstractWe study DOL systems with immigration. We show that sequence and growth equivalence are deci...
AbstractThe types of codes dealt with in detail are prefix codes, suffix codes, and two special clas...
AbstractWe show by a simple argument how any algorithm for solving the D0L language equivalence prob...
AbstractIn a short note, Head (1991) showed that given an arbitrary finitely-generated submonoid M o...
AbstractWe have recently proved that there is a bound for the sequence equivalence problem of polyno...
AbstractIt is shown that it is decidable of any endomorphisms σ, σ1…, σm and any words P, P1…, Pn wh...
AbstractA system of generalized language equations over an alphabet A is a set of n equations in n v...
This paper considers equality languages and fixed-point languages of homomorphisms and deterministic...
AbstractWe provide a new algebraic grammar for generalized Dyck languages as introduced by Labelle a...
AbstractA OL system is called a quasi-deterministic OL system or a D'OL system for short if there is...
AbstractRestricted versions of DT0L systems, so-called commutative DT0L systems, are considered. In ...
We review the rudiments of the equational logic of (least) fixed points and provide some of its appl...
AbstractThe paper investigates infinite words, and sets of them, associated with DOL and DTOL system...
AbstractWe show that for several classes of idempotent semirings the least fixed-point of a polynomi...
AbstractWe study bispecial factors in fixed points of morphisms. In particular, we propose a simple ...
AbstractWe study DOL systems with immigration. We show that sequence and growth equivalence are deci...
AbstractThe types of codes dealt with in detail are prefix codes, suffix codes, and two special clas...
AbstractWe show by a simple argument how any algorithm for solving the D0L language equivalence prob...
AbstractIn a short note, Head (1991) showed that given an arbitrary finitely-generated submonoid M o...
AbstractWe have recently proved that there is a bound for the sequence equivalence problem of polyno...
AbstractIt is shown that it is decidable of any endomorphisms σ, σ1…, σm and any words P, P1…, Pn wh...
AbstractA system of generalized language equations over an alphabet A is a set of n equations in n v...
This paper considers equality languages and fixed-point languages of homomorphisms and deterministic...
AbstractWe provide a new algebraic grammar for generalized Dyck languages as introduced by Labelle a...
AbstractA OL system is called a quasi-deterministic OL system or a D'OL system for short if there is...
DOI
Add to ORKG