Abstract
Developmental process of a multi-cellular organism is considered as a series of graphs, whose nodes correspond to cells and edges to cellular interconnections. We introduce a new machinary, called rational machine, for generating series of finite directed graphs. From the biological motivation, each node is named with a string of symbols. At first, the growth rate of graphs is analyzed. The generative capability of rational machines is shown by giving many examples. Decision problems and closure properties under graph operations are also discussed. Among others it is shown that whether two rational machines generate the same series of graphs is undecidable.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Griffiths, T.V. (1968), The unsolvability of the equivalence problem for λ-free nondeterministic generalized machine, JACM, 15, 409–413.
Herman,G and Rozenberg,G(1975), "Developmental Systems and Languages" North-Holland
Nagl,M(1979) in Graphs, Data Structures,Algorithms, "Applied Computer Science 13 ", HanserVerlag
Nishio, H(1978) Cell lineage system for describing growths/of filamentous organisms, Inform.Contr., 37, 280–301.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nishio, H. (1981). Series of graphs generated by rational machines. In: Noltemeier, H. (eds) Graphtheoretic Concepts in Computer Science. WG 1980. Lecture Notes in Computer Science, vol 100. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10291-4_2
Download citation
DOI: https://doi.org/10.1007/3-540-10291-4_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10291-5
Online ISBN: 978-3-540-38435-9
eBook Packages: Springer Book Archive