{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:43:59Z","timestamp":1750308239818,"version":"3.41.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319591070"},{"type":"electronic","value":"9783319591087"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59108-7_2","type":"book-chapter","created":{"date-parts":[[2017,5,16]],"date-time":"2017-05-16T08:43:06Z","timestamp":1494924186000},"page":"16-29","source":"Crossref","is-referenced-by-count":6,"title":["Trajectories and Traces on Non-traditional Regular Tessellations of the Plane"],"prefix":"10.1007","author":[{"given":"Benedek","family":"Nagy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arif","family":"Akkele\u015f","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,17]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0167-8655(89)90043-3","volume":"9","author":"PP Das","year":"1988","unstructured":"Das, P.P.: An algorithm for computing the number of minimal paths in digital images. Pattern Recognit. Lett. 9, 107\u2013116 (1988)","journal-title":"Pattern Recognit. Lett."},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/0167-8655(91)90013-C","volume":"10","author":"PP Das","year":"1991","unstructured":"Das, P.P.: Computing minimal paths in digital geometry. Pattern Recognit. Lett. 10, 595\u2013603 (1991)","journal-title":"Pattern Recognit. Lett."},{"volume-title":"The Book of Traces","year":"1995","key":"2_CR3","unstructured":"Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995)"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-319-26145-4_9","volume-title":"Combinatorial Image Analysis","author":"M Dutt","year":"2015","unstructured":"Dutt, M., Biswas, A., Nagy, B.: Number of shortest paths in triangular grid for 1- and 2-neighborhoods. In: Barneva, R.P., Bhattacharya, B.B., Brimkov, V.E. (eds.) IWCIA 2015. LNCS, vol. 9448, pp. 115\u2013124. Springer, Cham (2015). doi: 10.1007\/978-3-319-26145-4_9"},{"issue":"9","key":"2_CR5","doi-asserted-by":"crossref","first-page":"1213","DOI":"10.1109\/83.413166","volume":"4","author":"I Her","year":"1995","unstructured":"Her, I.: Geometric transformations on the hexagonal grid. IEEE Trans. Image Process. 4(9), 1213\u20131222 (1995)","journal-title":"IEEE Trans. Image Process."},{"key":"2_CR6","volume-title":"Parallel Approach of Algorithms","author":"T Herendi","year":"2014","unstructured":"Herendi, T., Nagy, B.: Parallel Approach of Algorithms. Typotex, Budapest (2014)"},{"key":"2_CR7","unstructured":"Janicki, R., Kleijn, J., Koutny, M., Mikulski, L.: Generalising traces, CS-TR-1436, Technical report, Newcastle University (2014). Partly presented at LATA 2015"},{"issue":"5","key":"2_CR8","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1109\/TC.1976.1674642","volume":"C\u201325","author":"E Luczak","year":"1976","unstructured":"Luczak, E., Rosenfeld, A.: Distance on a hexagonal grid. Trans. Comput. C\u201325(5), 532\u2013533 (1976)","journal-title":"Trans. Comput."},{"key":"2_CR9","unstructured":"Mateescu, A., Rozenberg, G., Salomaa, A.: Shuffle on trajectories: syntactic constraints. Theor. Comput. Sci. 197, 1\u201356 (1998)"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Nagy, B.: Finding shortest path with neighborhood sequences in triangular grids. In: Proceedings of the 2nd ISPA, pp. 55\u201360 (2001)","DOI":"10.1109\/ISPA.2001.938603"},{"key":"2_CR11","doi-asserted-by":"crossref","first-page":"111","DOI":"10.2498\/cit.2003.02.04","volume":"11","author":"B Nagy","year":"2003","unstructured":"Nagy, B.: Shortest path in triangular grids with neighbourhood sequences. J. Comput. Inf. Technol. 11, 111\u2013122 (2003)","journal-title":"J. Comput. Inf. Technol."},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-540-30503-3_8","volume-title":"Combinatorial Image Analysis","author":"B Nagy","year":"2004","unstructured":"Nagy, B.: Calculating distance with neighborhood sequences in the hexagonal grid. In: Klette, R., \u017duni\u0107, J. (eds.) IWCIA 2004. LNCS, vol. 3322, pp. 98\u2013109. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-30503-3_8"},{"key":"2_CR13","unstructured":"Nagy, B.: Digital geometry of various grids based on neighbourhood structures. In: KEPAF 2007, 6th Conference of Hungarian Association for Image Processing and Pattern Recognition, Debrecen, pp. 46\u201353 (2007)"},{"key":"2_CR14","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.patrec.2006.06.007","volume":"28","author":"B Nagy","year":"2007","unstructured":"Nagy, B.: Distances with neighbourhood sequences in cubic and triangular grids. Pattern Recognit. Lett. 28, 99\u2013109 (2007)","journal-title":"Pattern Recognit. Lett."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Nagy, B.: Isometric transformations of the dual of the hexagonal lattice. In: Proceedings of the 6th ISPA, pp. 432\u2013437 (2009)","DOI":"10.1109\/ISPA.2009.5297709"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-319-07148-0_5","volume-title":"Combinatorial Image Analysis","author":"B Nagy","year":"2014","unstructured":"Nagy, B.: Weighted distances on a triangular grid. In: Barneva, R.P., Brimkov, V.E., \u0160lapal, J. (eds.) IWCIA 2014. LNCS, vol. 8466, pp. 37\u201350. Springer, Cham (2014). doi: 10.1007\/978-3-319-07148-0_5"},{"key":"2_CR17","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s10472-014-9404-z","volume":"75","author":"B Nagy","year":"2015","unstructured":"Nagy, B.: Cellular topology and topological coordinate systems on the hexagonal and on the triangular grids. Ann. Math. Artif. Intell. 75, 117\u2013134 (2015)","journal-title":"Ann. Math. Artif. Intell."},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-642-13089-2_39","volume-title":"Language and Automata Theory and Applications","author":"B Nagy","year":"2010","unstructured":"Nagy, B., Otto, F.: CD-systems of stateless deterministic R(1)-automata accept all rational trace languages. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 463\u2013474. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-13089-2_39"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/978-3-642-18381-2_34","volume-title":"SOFSEM 2011: Theory and Practice of Computer Science","author":"B Nagy","year":"2011","unstructured":"Nagy, B., Otto, F.: An automata-theoretical characterization of context-free trace languages. In: \u010cern\u00e1, I., Gyim\u00f3thy, T., Hromkovi\u010d, J., Jefferey, K., Kr\u00e1lovi\u0107, R., Vukoli\u0107, M., Wolf, S. (eds.) SOFSEM 2011. LNCS, vol. 6543, pp. 406\u2013417. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-18381-2_34"},{"key":"2_CR20","first-page":"413","volume":"45","author":"B Nagy","year":"2011","unstructured":"Nagy, B., Otto, F.: CD-systems of stateless deterministic R $$(1)$$ -automata governed by an external pushdown store. RAIRO-ITA 45, 413\u2013448 (2011)","journal-title":"RAIRO-ITA"},{"key":"2_CR21","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1016\/j.jcss.2011.12.009","volume":"78","author":"B Nagy","year":"2012","unstructured":"Nagy, B., Otto, F.: On CD-systems of stateless deterministic R-automata with window size one. J. Comput. Syst. Sci. 78, 780\u2013806 (2012)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"2_CR22","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R Parikh","year":"1966","unstructured":"Parikh, R.: On context-free languages. J. ACM 13(4), 570\u2013581 (1966)","journal-title":"J. ACM"},{"key":"2_CR23","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0031-3203(68)90013-7","volume":"1","author":"A Rosenfeld","year":"1968","unstructured":"Rosenfeld, A., Pfaltz, J.L.: Distance functions on digital pictures. Pattern Recognit. 1, 33\u201361 (1968)","journal-title":"Pattern Recognit."},{"volume-title":"Handbook of Formal Languages","year":"1997","key":"2_CR24","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 1\u20133. Springer, Heidelberg (1997)"},{"key":"2_CR25","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1109\/71.629486","volume":"8","author":"I Stojmenovic","year":"1997","unstructured":"Stojmenovic, I.: Honeycomb networks: topological properties and communication algorithms. IEEE Trans. Parallel Distrib. Syst. 8, 1036\u20131042 (1997)","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Image Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59108-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:41:04Z","timestamp":1750264864000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59108-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319591070","9783319591087"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59108-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}