{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:32:26Z","timestamp":1759638746530},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540958840"},{"type":"electronic","value":"9783540958857"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-540-95885-7_15","type":"book-chapter","created":{"date-parts":[[2009,1,14]],"date-time":"2009-01-14T23:07:19Z","timestamp":1231974439000},"page":"204-216","source":"Crossref","is-referenced-by-count":6,"title":["On Testing P Systems"],"prefix":"10.1007","author":[{"given":"Marian","family":"Gheorghe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florentin","family":"Ipate","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/11603047_2","volume-title":"Membrane Computing","author":"O. Andrei","year":"2006","unstructured":"Andrei, O., Ciobanu, G., Lucanu, D.: Structural operational semantics of P systems. In: Freund, R., P\u0103un, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2005. LNCS, vol.\u00a03850, pp. 31\u201348. Springer, Heidelberg (2006)"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.tcs.2006.12.016","volume":"373","author":"O. Andrei","year":"2007","unstructured":"Andrei, O., Ciobanu, G., Lucanu, D.: A rewriting logic framework for operational semantics of membrane systems. Theoretical Computer Sci.\u00a0373, 163\u2013181 (2007)","journal-title":"Theoretical Computer Sci."},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.tcs.2006.07.020","volume":"363","author":"C. C\u00e2mpeanu","year":"2006","unstructured":"C\u00e2mpeanu, C., P\u0103un, A., Smith, J.R.: Incremental construction of minimal deterministic finite cover automata. Theoretical Computer Sci.\u00a0363, 135\u2013148 (2006)","journal-title":"Theoretical Computer Sci."},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1142\/S0129054102000960","volume":"13","author":"C. C\u00e2mpeanu","year":"2002","unstructured":"C\u00e2mpeanu, C., P\u0103un, A., Yu, S.: An efficient algorithm for constructing minimal cover automata for finite languages. Intern. J. Foundation of Computer Sci.\u00a013, 83\u201397 (2002)","journal-title":"Intern. J. Foundation of Computer Sci."},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/3-540-48057-9_4","volume-title":"Automata Implementation","author":"C. C\u00e2mpeanu","year":"1999","unstructured":"C\u00e2mpeanu, C., S\u00e2ntean, N., Yu, S.: Minimal cover-automata for finite languages. In: Champarnaud, J.-M., Maurel, D., Ziadi, D. (eds.) WIA 1998. LNCS, vol.\u00a01660, pp. 43\u201356. Springer, Heidelberg (1999)"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00292-9","volume":"267","author":"C. C\u00e2mpeanu","year":"2002","unstructured":"C\u00e2mpeanu, C., S\u00e2ntean, N., Yu, S.: Minimal cover-automata for finite languages. Theoretical Computer Sci.\u00a0267, 3\u201316 (2002)","journal-title":"Theoretical Computer Sci."},{"volume-title":"Applications of Membrane Computing","year":"2006","key":"15_CR7","unstructured":"Ciobanu, G., P\u0103un, G., P\u00e9rez-Jim\u00e9nez, M.J. (eds.): Applications of Membrane Computing. Springer, Heidelberg (2006)"},{"key":"15_CR8","first-page":"193","volume":"83","author":"P. Garc\u00eda","year":"2004","unstructured":"Garc\u00eda, P., Ruiz, J.: A note on the minimal cover-automata for finite languages. Bulletin of the EATCS\u00a083, 193\u2013194 (2004)","journal-title":"Bulletin of the EATCS"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"M.E. Gold","year":"1978","unstructured":"Gold, M.E.: Complexity of automaton identification from given data. Information and Control\u00a037, 302\u2013320 (1978)","journal-title":"Information and Control"},{"key":"15_CR10","volume-title":"Correct Systems \u2013 Building Business Process Solutions","author":"M. Holcombe","year":"1998","unstructured":"Holcombe, M., Ipate, F.: Correct Systems \u2013 Building Business Process Solutions. Springer, Heidelberg (1998)"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/3-540-44977-9_11","volume-title":"Implementation and Application of Automata","author":"H. K\u00f6rner","year":"2003","unstructured":"K\u00f6rner, H.: On minimizing cover automata for finite languages in O(n log n) time. In: Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2002. LNCS, vol.\u00a02608, pp. 117\u2013127. Springer, Heidelberg (2003)"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1142\/S0129054103002187","volume":"14","author":"H. K\u00f6rner","year":"2003","unstructured":"K\u00f6rner, H.: A time and space efficient algorithm for minimizing cover automata for finite languages. Intern. J. Foundation of Computer Sci.\u00a014, 1071\u20131086 (2003)","journal-title":"Intern. J. Foundation of Computer Sci."},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/3-540-45314-8_15","volume-title":"Fundamental Approaches to Software Engineering","author":"R. L\u00e4mmel","year":"2001","unstructured":"L\u00e4mmel, R.: Grammar testing. In: Hussmann, H. (ed.) FASE 2001. LNCS, vol.\u00a02029, pp. 201\u2013216. Springer, Heidelberg (2001)"},{"key":"15_CR14","first-page":"300","volume":"1","author":"H. Li","year":"2004","unstructured":"Li, H., Jin, M., Liu, C., Gao, Z.: Test criteria for context-free grammars. COMPSAC\u00a01, 300\u2013305 (2004)","journal-title":"COMPSAC"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1142\/9789812797902_0004","volume-title":"Pattern Recognition and Image Qnalysis","author":"J. Oncina","year":"1992","unstructured":"Oncina, J., Garc\u00eda, P.: Inferring regular languages in polynomial update time. In: de la Blanca, N.P., Sanfeliu, A., Vidal, E. (eds.) Pattern Recognition and Image Qnalysis, pp. 49\u201361. World Scientific, Singapore (1992)"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-44674-5_20","volume-title":"Implementation and Application of Automata","author":"A. P\u0103un","year":"2001","unstructured":"P\u0103un, A., S\u00e2ntean, N., Yu, S.: An O(n\n                    \n                      \n                    \n                    $^{\\mbox{2}}$\n                  ) algorithm for constructing minimal cover automata for finite languages. In: Yu, S., P\u0103un, A. (eds.) CIAA 2000. LNCS, vol.\u00a02088, pp. 243\u2013251. Springer, Heidelberg (2001)"},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1006\/jcss.1999.1693","volume":"61","author":"G. P\u0103un","year":"2000","unstructured":"P\u0103un, G.: Computing with membranes. J. Computer and System Sci.\u00a061, 108\u2013143 (2000)","journal-title":"J. Computer and System Sci."},{"key":"15_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56196-2","volume-title":"Membrane Computing. An Introduction","author":"G. P\u0103un","year":"2002","unstructured":"P\u0103un, G.: Membrane Computing. An Introduction. Springer, Heidelberg (2002)"},{"key":"15_CR19","unstructured":"The P Systems Web Site, \n                    \n                      http:\/\/ppage.psystems.eu"}],"container-title":["Lecture Notes in Computer Science","Membrane Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-95885-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T17:28:26Z","timestamp":1551720506000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-95885-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783540958840","9783540958857"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-95885-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}