{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:11:59Z","timestamp":1725459119016},"publisher-location":"Berlin\/Heidelberg","reference-count":23,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540123172"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0036911","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T17:38:14Z","timestamp":1138210694000},"page":"226-236","source":"Crossref","is-referenced-by-count":4,"title":["Initial index: A new complexity function for languages"],"prefix":"10.1007","author":[{"given":"J.","family":"Gabarro","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and Context free languages","author":"J. Berstel","year":"1979","unstructured":"Berstel, J. [1979]. \u201cTransductions and Context free languages\u201d, Teubner Studienb\u00fccher, Stuttgart."},{"key":"19_CR2","unstructured":"Boasson, L. [1971]. \u201cCones rationnels et familles agreables de langages \u2014 application aux langages a compteur\u201d. Th\u00e8se de 3\u00e8me cycle. Paris VII."},{"issue":"2","key":"19_CR3","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1137\/0210020","volume":"10","author":"L Boasson","year":"1981","unstructured":"Boasson, L; B. Courcelle; M. Nivat [1981]. \u201cThe rational index a complexity measure for languages\u201d. SIAM Journal on computing 10, 2, 284\u2013296.","journal-title":"SIAM Journal on computing"},{"key":"19_CR4","unstructured":"Book, R. [1982]. \u201cIntersection of CFL's and related structures\u201d in Actes de l'\u00e9cole de printemps de th\u00e9orie de langages. Editeur Blab. M. publication of LITP n\u2134 82-14."},{"issue":"3","key":"19_CR5","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0304-3975(81)90043-8","volume":"14","author":"W Bucher","year":"1981","unstructured":"Bucher. W; K. Culik; H. Maurer; D. Wotschke. \u201cConcise description of finite languages\u201d. Theor. Comput. Sci. 14, 3, 211\u2013347 (1981).","journal-title":"Theor. Comput. Sci."},{"key":"19_CR6","unstructured":"Culik II. K; H.A. Maurer. \u201cOn the derivation trees\u201d. Internal report."},{"key":"19_CR7","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0019-9958(77)90558-7","volume":"33","author":"S. Crespi-Reghizzi","year":"1977","unstructured":"Crespi-Reghizzi, S.; D. Mandrioli [1977] \u201cPetri nets and Szilard languages\u201d, Inf. and Control, 33, 177\u2013192.","journal-title":"Inf. and Control"},{"key":"19_CR8","unstructured":"Deleage, J.L. [1982]. \u201cMemoire de D.E.A.\u201d, Paris VII, unpublihed manuscript."},{"key":"19_CR9","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01694011","volume":"3","author":"P.C. Fischer","year":"1968","unstructured":"Fischer, P.C.; A.R. Meyer; A.L. Rosenberg [1968], Math. Syst. Theor.2. 3, 265.","journal-title":"Math. Syst. Theor.2."},{"issue":"4","key":"19_CR10","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1051\/ita\/1982160403171","volume":"16","author":"J. Gabarro","year":"1982","unstructured":"Gabarro, J. [1982]. \u201cUne application des notions de centre et index rationnel \u00e0 certains langages alg\u00e9briques\u201d. RAIRO Inf. Theor. 16, 4, 317\u2013329.","journal-title":"RAIRO Inf. Theor."},{"key":"19_CR11","first-page":"1","volume":"87","author":"S. Ginsburg","year":"1969","unstructured":"Ginsburg, S.; Greibach, S. [1969]. \u201cAbstract families of languages\u201d in Abstract families of languages. Mem. of the Amer. Math. Soc. 87, 1\u201332.","journal-title":"Abstract families of languages. Mem. of the Amer. Math. Soc."},{"key":"19_CR12","unstructured":"Goodrich, G.B.; Ladner, R.E.; Fischer, M. J. [1977]. \u201cStraight-Line programs to compute finite languages\u201d, A conference on Theorethical Computer Science, Aug. 1977, Waterloo, Canada."},{"key":"19_CR13","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0304-3975(76)90072-4","volume":"1","author":"S.A. Greibach","year":"1976","unstructured":"Greibach, S.A. [1976]. Remarks on the complexity of non deterministic counter languages\u201d, Theor. Comput. Sci. 1, 269\u2013288.","journal-title":"Theor. Comput. Sci."},{"key":"19_CR14","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0304-3975(78)90020-8","volume":"7","author":"S.A. Greibach","year":"1978","unstructured":"Greibach, S.A. [1978]. Remarks on blind and partially blind one-way multicounter machines\u201d, Theor. Comput. Sci. 7, 311\u2013324.","journal-title":"Theor. Comput. Sci."},{"key":"19_CR15","volume-title":"\u201cPetri nets languages\u201d, Computation Structures Group Memo 124, Project MAC","author":"M. Hack","year":"1975","unstructured":"Hack, M. [1975]. \u201cPetri nets languages\u201d, Computation Structures Group Memo 124, Project MAC, MIT Cambridge, Mass."},{"issue":"1","key":"19_CR16","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1051\/ita\/1979130100191","volume":"13","author":"M. Jantzen","year":"1973","unstructured":"Jantzen, M. [1973]. \u201cOne hierarchy of Petri net languages\u201d, RAIRO Inf. Theor. 13, 1, 19\u201330.","journal-title":"RAIRO Inf. Theor."},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Knuth, D.E. [1976]. \u201cBig omicron and big omega and big theta\u201d. Sigact News Apr\u2013June 18\u201324.","DOI":"10.1145\/1008328.1008329"},{"key":"19_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4310\/jdg\/1214501132","volume":"2","author":"J. Milnor","year":"1968","unstructured":"Milnor, J. [1968]. \u201cA note on curvature and fundamental group\u201d, J. Differential Geometry 2, 1\u20137.","journal-title":"J. Differential Geometry"},{"key":"19_CR19","doi-asserted-by":"crossref","first-page":"339","DOI":"10.5802\/aif.287","volume":"18","author":"M. Nivat","year":"1968","unstructured":"Nivat, M. [1968]. \u201cTransductions des langages de Chomsky\u201d. Ann. de 1'Ins t. Fourier 18, 339\u2013456.","journal-title":"Ann. de 1'Ins t. Fourier"},{"key":"19_CR20","first-page":"73","volume":"I","author":"J. Paredaens","year":"1977","unstructured":"Paredaens, J.; R. Vyncke [1977]. \u201cA class of measure on formal languages\u201d. Acta Informatica, I, 73\u201386.","journal-title":"Acta Informatica"},{"issue":"1","key":"19_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0022-0000(76)80047-5","volume":"13","author":"J.L. Peterson","year":"1976","unstructured":"Peterson, J.L. [1976]. \u201cComputations sequence sets\u201d, J. Comput. and Syst. Sci. 13, 1, 1\u201324.","journal-title":"J. Comput. and Syst. Sci."},{"issue":"4","key":"19_CR22","first-page":"660","volume":"19","author":"J.E. Savage","year":"1972","unstructured":"Savage, J.E. 1972. \u201cComputational work and time on Finite Machines\u201d. J.A.C.M. 19, 4, 660\u2013674.","journal-title":"J.A.C.M."},{"key":"19_CR23","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/BF02572559","volume":"21","author":"V.I. Trofimov","year":"1980","unstructured":"Trofimov, V.I. [1980]. \u201cThe growth function of finitely generated semigroup\u201d, Semigroup Forum 21, 351\u2013360.","journal-title":"Semigroup Forum"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0036911.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:21:32Z","timestamp":1607552492000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0036911"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540123172"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/bfb0036911","relation":{},"subject":[]}}