On synchronized Lindenmayer picture languages (Q4036773)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 176937
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On synchronized Lindenmayer picture languages |
scientific article; zbMATH DE number 176937 |
Statements
18 May 1993
0 references
Lindenmayer systems
0 references
chain code picture
0 references
0.8564152717590332
0 references
0.8462435603141785
0 references
0.8092559576034546
0 references
On synchronized Lindenmayer picture languages (English)
0 references
[For the entire collection see Zbl 0755.00005.] The paper deals with chain code picture languages (in the sense of \textit{H. Maurer, G. Rozenberg, E. Welzl} [Inf. Control 54, 155-185 (1982; Zbl 0523.68065)]), that is string description of two-dimensional pictures composed of vertical and horizontal unitary segments: right (r), left (l), up (u), down (d). One considers TOL, DTOL, OL and DOL (synchronized) systems on the alphabet \(\{r,l,u,d\}\). The power of such systems is investigated as well as some decidability problems (for a synchronized TOL system \(G\), it is proved to be decidable whether or not \(B(G)\), the set of pictures described by \(G\), is finite, contains a given picture \(p\), contains a tree, or a circuit).
0 references
