scientific article; zbMATH DE number 176937

zbMATH Open0771.68073MaRDI QIDQ4036773FDOQ4036773

Authors: Juraj Hromkovič, Jürgen Dassow 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

Lindenmayer systemschain code picture

Mathematics Subject Classification ID

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

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• The finiteness of synchronous, tabled picture languages is decidable
• Title not available (Why is that?)
• Developments in Language Theory
• Title not available (Why is that?)

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)