{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:17:25Z","timestamp":1725455845946},"publisher-location":"Berlin\/Heidelberg","reference-count":8,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354010576X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0017298","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T02:22:34Z","timestamp":1132626154000},"page":"70-75","source":"Crossref","is-referenced-by-count":0,"title":["Verallgemeinerte kommutative Sprachen"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Keklikoglou","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","volume-title":"Automata,languages. Vol B","author":"S. Eilenberg","year":"1976","unstructured":"Eilenberg S., Automata,languages. Vol B, Akademic Press, New York, San Francisco, London 1976."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Greibach S., The hardest contextfree language. SIAM J.Computing 2 (1973)","DOI":"10.1137\/0202025"},{"key":"10_CR3","unstructured":"Huynh T., On the complexity of semilinear sets. Research Report A79\/16, University of Saarbr\u00fccken."},{"key":"10_CR4","volume-title":"Verallgemeinerte kommutative Sprachen","author":"I. Kelikoglou","year":"1980","unstructured":"Kelikoglou I., Verallgemeinerte kommutative Sprachen, Dissertation, Darmstadt 1980."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Morse M., Hedlung G., Unending Chess,symbolic dynamics and a problem in semigroups. Duke Math. Journal 11 (1944)","DOI":"10.1215\/S0012-7094-44-01101-4"},{"key":"10_CR6","unstructured":"Ochsenschl\u00e4ger P.,Verallgemeinerte Parikh-Abbildungen und DOL-Systeme. Technischer Bericht AFS-33,TH Darmstadt,FB Informatik, 1977."},{"key":"10_CR7","volume-title":"Erweiterung des freien Monoids \u03a3*","author":"H. Prodinger","year":"1978","unstructured":"Prodinger H., Erweiterung des freien Monoids \u03a3*, Dissertation, Wien 1978."},{"key":"10_CR8","unstructured":"Thue A., \u00dcber die gegenseitige Lage gewisser Zeichenreihen. Videskap. Skrifter I Math.-Naturv.-Klasse 1912 No.1."}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017298.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T16:38:07Z","timestamp":1607531887000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017298"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354010576X"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0017298","relation":{},"subject":[]}}