scientific article; zbMATH DE number 176937

MaRDI QIDQ4036773zbMATHFDO

Authors Juraj Hromkovič, Jürgen Dassow

Publication date 18 May 1993

zbMATH Keywords

Lindenmayer systemschain code picture

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 2213331
• scientific article; zbMATH DE number 2051902
• Developments in Language Theory
• The finiteness of synchronous, tabled picture languages is decidable
• Complexity and decidability for chain code picture languages

Cited in

(6)

• Developments in Language Theory
• The finiteness of synchronous, tabled picture languages is decidable
• scientific article; zbMATH DE number 2051902 (Why is no real title available?)
• scientific article; zbMATH DE number 2213331 (Why is no real title available?)
• scientific article; zbMATH DE number 1543317 (Why is no real title available?)
• scientific article; zbMATH DE number 4126715 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4036773)