L systems

zbMath0281.00016MaRDI QIDQ1843534

No author found.

Publication date: 1974

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Automata and formal grammars in connection with logical questions (03D05) Conference proceedings and collections of articles (00Bxx)

Related Items (21)

Unnamed Item ⋮ Unnamed Item ⋮ MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS ⋮ Codeterministic Lindenmayer schemes and systems ⋮ Symbolic substitutions, Bratteli diagrams and operator algebras ⋮ Log diameter restricted bottom-up triangle cellular acceptors ⋮ ETOL-grammars and N-grammars ⋮ A decomposition theorem for hyper-algebraic extensions of language families ⋮ Context-free grammars with graph-controlled tables ⋮ A relationship between ETOL and EDTOL languages ⋮ On slicing of K-iteration grammars ⋮ Surface tree languages and parallel derivation trees ⋮ TIL systems and languages ⋮ Iterating iterated substitution ⋮ Two characterization theorems of locally catenative developmental systems ⋮ Synchronization and computing capabilities of linear asynchronous structures ⋮ Lindenmayer grammars and symbolic testing ⋮ Quasi-deterministic 0L systems ⋮ Inference of bounded L systems with polymorphic P systems ⋮ Extended macro grammars and stack controlled machines ⋮ Unnamed Item

This page was built for publication: L systems