Description of developmental languages using recurrence systems (Q4072878)

From MaRDI portal

Revision as of 16:24, 12 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Description of developmental languages using recurrence systems	scientific article

Statements

scholarly article

0 references

Description of developmental languages using recurrence systems (English)

0 references

Gabor T. Herman

0 references

Aristid Lindenmayer

0 references

Grzegorz Rozenberg

0 references

Mathematical Systems Theory

0 references

publication date

1975

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

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

0 references

The equality of EOL languages and codings of ol languages

0 references

On the nonexistence of a phrase structure grammar for ALGOL 60

0 references

0 references

Two Families of Languages Related to ALGOL

0 references

Closure properties of some families of languages associated with biological systems

0 references

A biologically motivated extension of ALGOL-like languages

0 references

0 references

0 references

An extension of ALGOL-like languages

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

On 0L-Languages

0 references

Development systems with locally catenative formulas

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/BF01780579

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4072878

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