The decidability of the DOL-DTOL equivalence problem (Q1167540)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	The decidability of the DOL-DTOL equivalence problem	scientific article

Statements

scholarly article

0 references

The decidability of the DOL-DTOL equivalence problem (English)

0 references

0 references

Journal of Computer and System Sciences

0 references

publication date

1981

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/0022-0000(81)90020-9

0 references

The unsolvability of the equality problem for sentential forms of context-free grammars

0 references

The decidability of the equivalence problem for DOL-systems

0 references

Elementary homomorphisms and a solution of the DOL sequence equivalence problem

0 references

Description of developmental languages using recurrence systems

0 references

On the decidability of some equivalence problems for DOL-systems

0 references

Direct proofs of the undecidability of the equivalence problem for sentential forms of linear context-free grammars and the equivalence problem for OL systems

0 references

The equivalence problem for deterministic TOL-systems is undecidable

0 references

0 references

A note on language equations involving morphisms

0 references

0 references

On the decidability of the OL-DOL equivalence problem

0 references

The decidability of the FOL-DOL equivalence problem

0 references

0 references

On sentential forms of context-free grammars

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/0022-0000(81)90020-9

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1167540

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