{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:00:09Z","timestamp":1762459209517},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319113302"},{"type":"electronic","value":"9783319113319"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11331-9_24","type":"book-chapter","created":{"date-parts":[[2014,9,2]],"date-time":"2014-09-02T10:39:50Z","timestamp":1409654390000},"page":"195-202","source":"Crossref","is-referenced-by-count":2,"title":["Characteristics of Bottom-Up Parsable edNLC Graph Languages for Syntactic Pattern Recognition"],"prefix":"10.1007","author":[{"given":"Mariusz","family":"Flasi\u0144ski","sequence":"first","affiliation":[]},{"given":"Zofia","family":"Flasi\u0144ska","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Blum, M., Hewitt, C.: Automata on a two-dimensional tape. In: Proc. 8th IEEE Conf. Switching Automaton Theory, pp. 155\u2013160 (1968)","DOI":"10.1109\/FOCS.1967.6"},{"key":"24_CR2","unstructured":"Brayer, J.M.: Parsing of web grammars. In: Proc. IEEE Workshop Data Descr. Long Beach, CA (1977)"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/3-540-52292-1_10","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"H.O. Bunke","year":"1990","unstructured":"Bunke, H.O., Haller, B.: A parser for context free plex grammars. In: Nagl, M. (ed.) WG 1989. LNCS, vol.\u00a0411, pp. 136\u2013150. Springer, Heidelberg (1990)"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0019-9958(78)90528-4","volume":"37","author":"P. Vigna Della","year":"1978","unstructured":"Della Vigna, P., Ghezzi, C.: Context-free graph grammars. Inform. Control\u00a037, 207\u2013233 (1978)","journal-title":"Inform. Control"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/0031-3203(88)90034-9","volume":"21","author":"M. Flasi\u0144ski","year":"1988","unstructured":"Flasi\u0144ski, M.: Parsing of edNLC-graph grammars for scene analysis. Pattern Recognition\u00a021, 623\u2013629 (1988)","journal-title":"Pattern Recognition"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0734-189X(89)90050-9","volume":"47","author":"M. Flasi\u0144ski","year":"1989","unstructured":"Flasi\u0144ski, M.: Characteristics of edNLC - graph grammars for syntactic pattern recognition. Comput. Vision Graphics Image Process., CVGIP\u00a047, 1\u201321 (1989)","journal-title":"Comput. Vision Graphics Image Process., CVGIP"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1016\/0031-3203(90)90099-7","volume":"23","author":"M. Flasi\u0144ski","year":"1990","unstructured":"Flasi\u0144ski, M.: Distorted pattern analysis with the help of Nodel Label Controlled graph languages. Pattern Recognition\u00a023, 765\u2013774 (1990)","journal-title":"Pattern Recognition"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0031-3203(93)90083-9","volume":"26","author":"M. Flasi\u0144ski","year":"1993","unstructured":"Flasi\u0144ski, M.: On the parsing of deterministic graph languages for syntactic pattern recognition. Pattern Recognition\u00a026, 1\u201316 (1993)","journal-title":"Pattern Recognition"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/0010-4485(94)00015-6","volume":"27","author":"M. Flasi\u0144ski","year":"1995","unstructured":"Flasi\u0144ski, M.: Use of graph grammars for the description of mechanical parts. Computer Aided Design\u00a027, 403\u2013433 (1995)","journal-title":"Computer Aided Design"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0304-3975(97)00212-0","volume":"201","author":"M. Flasi\u0144ski","year":"1998","unstructured":"Flasi\u0144ski, M.: Power properties of NLC graph grammars with a polynomial membership problem. Theoretical Computer Science\u00a0201, 189\u2013231 (1998)","journal-title":"Theoretical Computer Science"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"2249","DOI":"10.1016\/j.patcog.2010.01.004","volume":"43","author":"M. Flasi\u0144ski","year":"2010","unstructured":"Flasi\u0144ski, M., My\u015bli\u0144ski, S.: On the use of graph parsing for recognition of isolated hand postures of Polish Sign Language. Pattern Recognition\u00a043, 2249\u20132264 (2010)","journal-title":"Pattern Recognition"},{"key":"24_CR12","unstructured":"Flasi\u0144ska, Z.: Bottom-up parser for edNLC graph grammars, MSc Thesis, AGH University of Science and Technology, Cracow (2013)"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF00289155","volume":"10","author":"R. Franck","year":"1978","unstructured":"Franck, R.: A class of linearly parsable graph grammars. Acta. Inform.\u00a010, 175\u2013201 (1978)","journal-title":"Acta. Inform."},{"key":"24_CR14","volume-title":"Syntactic Pattern Recognition and Applications","author":"K.S. Fu","year":"1982","unstructured":"Fu, K.S.: Syntactic Pattern Recognition and Applications. Prentice Hall, Englewood Cliffs (1982)"},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0020-0255(80)90038-9","volume":"20","author":"D. Janssens","year":"1980","unstructured":"Janssens, D., Rozenberg, G.: On the structure of node-label-controlled graph languages. Inform. Sci.\u00a020, 191\u2013216 (1980)","journal-title":"Inform. Sci."},{"key":"24_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/BFb0000108","volume-title":"Graph-Grammars and Their Application to Computer Science","author":"M. Kaul","year":"1983","unstructured":"Kaul, M.: Parsing of graphs in linear time. In: Ehrig, H., Nagl, M., Rozenberg, G. (eds.) Graph Grammars 1982. LNCS, vol.\u00a0153, pp. 206\u2013218. Springer, Heidelberg (1983)"},{"key":"24_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/3-540-19488-6_128","volume-title":"Automata, Languages and Programming","author":"C. Lautemann","year":"1988","unstructured":"Lautemann, C.: Efficient algorithms on context-free graph languages. In: Lepist\u00f6, T., Salomaa, A. (eds.) ICALP 1988. LNCS, vol.\u00a0317, pp. 362\u2013378. Springer, Heidelberg (1988)"},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/0031-3203(90)90026-H","volume":"23","author":"K.J. Peng","year":"1990","unstructured":"Peng, K.J., Yamamoto, T., Aoki, Y.: A new parsing scheme for plex grammars. Pattern Recognition\u00a023, 393\u2013402 (1990)","journal-title":"Pattern Recognition"},{"key":"24_CR19","first-page":"307","volume":"7","author":"A. Rosenfeld","year":"1972","unstructured":"Rosenfeld, A., Milgram, D.L.: Web automata and web grammars. Machine Intell\u00a07, 307\u2013324 (1972)","journal-title":"Machine Intell"},{"key":"24_CR20","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1109\/TPAMI.1983.4767426","volume":"5","author":"Q.Y. Shi","year":"1983","unstructured":"Shi, Q.Y., Fu, K.S.: Parsing and translation of attributed expansive graph languages for scene analysis. IEEE Trans. Pattern Analysis Mach. Intell., PAMI\u00a05, 472\u2013485 (1983)","journal-title":"IEEE Trans. Pattern Analysis Mach. Intell., PAMI"},{"key":"24_CR21","volume-title":"On the complexity of graph grammars","author":"G. Turan","year":"1982","unstructured":"Turan, G.: On the complexity of graph grammars. Techn. Rep. Automata Theory Research Group, Szeged (1982)"},{"key":"24_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/3-540-61228-9_86","volume-title":"Graph Grammars and Their Application to Computer Science","author":"L.M. Wills","year":"1996","unstructured":"Wills, L.M.: Using attributed graph parsing to recognize clich\u00e9s in programs. In: Cuny, J., Engels, G., Ehrig, H., Rozenberg, G. (eds.) Graph Grammars 1994. LNCS, vol.\u00a01073, pp. 170\u2013184. Springer, Heidelberg (1996)"},{"key":"24_CR23","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1093\/comjnl\/44.3.186","volume":"44","author":"D.Q. Zhang","year":"2001","unstructured":"Zhang, D.Q., Zhang, K., Cao, J.: A context-sensitive graph grammar formalism for the specification of visual languages. Computer J.\u00a044, 186\u2013200 (2001)","journal-title":"Computer J."}],"container-title":["Lecture Notes in Computer Science","Computer Vision and Graphics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11331-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T15:29:00Z","timestamp":1565796540000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11331-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319113302","9783319113319"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11331-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}