THE D0L ω-EQUIVALENCE PROBLEM (Q3426793)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	THE D0L ω-EQUIVALENCE PROBLEM	scientific article

Statements

scholarly article

0 references

THE D0L ω-EQUIVALENCE PROBLEM (English)

0 references

International Journal of Foundations of Computer Science

0 references

publication date

13 March 2007

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

On the decidability of the sequence equivalence problem for DOL-systems

0 references

The decidability of the equivalence problem for DOL-systems

0 references

The ω sequence problem for DOL systems is decidable

0 references

On infinite words obtained by iterating morphisms

0 references

Elementary homomorphisms and a solution of the DOL sequence equivalence problem

0 references

A short solution for the HDT0L sequence equivalence problem

0 references

REMARKS CONCERNING THE D0L ω-EQUIVALENCE PROBLEM

0 references

The equivalence problem of polynomially bounded D0L systems -- a bound depending only on the size of the alphabet

0 references

The class of HDT0L sequences is closed with respect to rational functions

0 references

An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet

0 references

0 references

full work available at URL

https://doi.org/10.1142/s0129054107004620

0 references

Identifiers

zbMATH Open document ID

0 references

10.1142/S0129054107004620

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3426793

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3426793&oldid=37441985"