آمار
| تعداد نشریات | 7 |
| تعداد شماره‌ها | 102 |
| تعداد مقالات | 1,145 |
| تعداد مشاهده مقاله | 1,053,104 |
| تعداد دریافت فایل اصل مقاله | 874,748 |
Triangular Tile Latching System | ||
| Communications in Combinatorics and Optimization | ||
| مقاله 11، دوره 9، شماره 2، شهریور 2024، صفحه 309-316 اصل مقاله (370.15 K) | ||
| نوع مقاله: Short notes | ||
| شناسه دیجیتال (DOI): 10.22049/cco.2022.27994.1415 | ||
| نویسندگان | ||
| Kanchan Devi K1؛ Subramanian Arumugam* 2 | ||
| 1National Centre for Advanced Research in Discrete Mathematics, Kalasalingam Academy of Research and Education, Krishnankoil-626126, Tamil Nadu, India | ||
| 2Director (n-CARDMATH) Kalasalingam University Anand Nagar, Krishnankoil-626 126 Tamil Nadu, India | ||
| چکیده | ||
| A triangular tile latching system consists of a set $\Sigma$ of equilateral triangular tiles with at least one latchable side and an attachment rule which permits two tiles to get latched along a latchable side. In this paper we determine the language generated by a triangular tile latching system in terms of planar graphs. | ||
| کلیدواژه‌ها | ||
| Attachment rule؛ latching system؛ planar graph | ||
| مراجع | ||
|
[1] K. Bhuvaneswari and T. Kalyani, Triangular tile pasting p system for pattern generation, Conference Proceeding of ICAMTCS-2013, 2013, pp. 26–30.
[2] K. Bhuvaneswari, T. Kalyani, and D.G. Thomas, Contextual iso-triangular array p system and iso-triangular picture languages, Asian Conference on Membrane Computing ACMC 2014, IEEE, 2014, pp. 1–5.
[3] K. Bhuvaneswari, T. Kalyani, D.G. Thomas, A. Nagar, and T. Robinson, Isoarray rewriting p systems with context-free iso-array rules, Int. J. Math. Appl. 3 (2014), no. 1, 1–16. https://doi.org/10.13164/ma.2014.01 [4] J. Bishop, S. Burden, E. Klavins, R. Kreisberg, W. Malone, N. Napp, and T. Nguyen, Programmable parts: A demonstration of the grammatical approach to self-organization, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems, IEEE, 2005, pp. 3684–3691.
[5] G. Chartrand, L. Lesniak, and P. Zhang, Graphs & digraphs, Chapman & Hall London, $4^{th}$ edition, 2005.
[6] T. Kalyani, K. Sasikala, V.R. Dare, P.J. Abisha, and T. Robinson, Triangular pasting system, Formal Models, Languages and Applications (K.G. Subramanian, K. Rangarajan, and M. Mukund, eds.), Series in Machine Perception and Artificial Intelligence, 2006, pp. 195–211. [7] M. Nivat, A. Saoudi, K.G. Subramanian, R. Siromoney, and V.R. Dare, Puzzle grammars and context-free array grammars, Int. J. Pattern Recognition and Artificial Intelligence 5 (1991), no. 5, 663–676. https://doi.org/10.1142/S0218001491000399 [8] T. Robinson, A study on circular languages, patterns and map systems, Doctoral Thesis, University of Madras, Chennai (2002).
[9] T. Robinson, Extended pasting scheme for kolam pattern generation, Forma 22 (2007), no. 1, 55–64.
[10] T. Robinson, V.R. Dare, and K.G. Subramanian, A parallel pattern generating system, Proc. of the 6th International Workshop on Parallel Image Processing and Analysis, 1999, pp. 23–32.
[11] T. Robinson, S. Jebasingh, A.K. Nagar, and K.G. Subramanian, Tile pasting systems for tessellation and tiling patterns, International Symposium Computational Modeling of Objects Represented in Images, Springer, 2010, pp. 72–84.
[12] K.G. Subramanian, R. Siromoney, V.R. Dare, and A. Saoudi, Basic puzzle languages, Int. J. Pattern Recognition Artificial Intelligence 9 (1995), no. 5, 763–775. | ||
|
آمار تعداد مشاهده مقاله: 292 تعداد دریافت فایل اصل مقاله: 1,270 |
||