{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:15Z","timestamp":1725664995078},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540628446"},{"type":"electronic","value":"9783540687030"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62844-4_1","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:50:23Z","timestamp":1330296623000},"page":"1-9","source":"Crossref","is-referenced-by-count":3,"title":["A grammatical approach to the LBA problem"],"prefix":"10.1007","author":[{"given":"Henning","family":"Bordihn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"1_CR1","unstructured":"H. Bordihn and H. Fernau. Accepting grammars and systems. Technical Report 9\/94, Universit\u00e4t Karlsruhe, Fakult\u00e4t f\u00fcr Informatik, 1994."},{"key":"1_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/00207169408804310","volume":"53","author":"H. Bordihn","year":"1994","unstructured":"H. Bordihn and H. Fernau. Accepting grammars with regulation. International Journal of Computer Mathematics, 53:1\u201318, 1994.","journal-title":"International Journal of Computer Mathematics"},{"issue":"2","key":"1_CR3","first-page":"97","volume":"1","author":"H. Bordihn","year":"1996","unstructured":"H. Bordihn and H. Fernau. Accepting grammars and systems via context condition grammars. Journal of Automata, Languages and Combinatorics, 1(2):97\u2013112, 1996.","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"1_CR4","volume-title":"volume 18 of EATCS Monographs in Theoretical Computer Science","author":"J. Dassow","year":"1989","unstructured":"J. Dassow and Gh. P\u0103un. Regulated Rewriting in Formal Language Theory, volume 18 of EATCS Monographs in Theoretical Computer Science. Berlin: Springer, 1989."},{"issue":"4","key":"1_CR5","first-page":"191","volume":"30","author":"H. Fernau","year":"1994","unstructured":"H. Fernau. Membership for 1-limited ETOL languages is not decidable. J. Inf. Process. Cybern. EIK (formerly Elektron. Inf.verarb. Kybern.), 30(4):191\u2013211, 1994.","journal-title":"J. Inf. Process. Cybern. EIK (formerly Elektron. Inf.verarb. Kybern.)"},{"key":"1_CR6","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. E. Hopcroft","year":"1979","unstructured":"J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Reading (MA): Addison-Wesley, 1979."},{"key":"1_CR7","unstructured":"A. K. Salomaa. Formal Languages. Academic Press, 1973."}],"container-title":["Lecture Notes in Computer Science","New Trends in Formal Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62844-4_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:39:43Z","timestamp":1619573983000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62844-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540628446","9783540687030"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-62844-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}