{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T16:54:55Z","timestamp":1688489695928},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1978]]},"DOI":"10.1007\/bf00289049","type":"journal-article","created":{"date-parts":[[2004,10,4]],"date-time":"2004-10-04T13:16:50Z","timestamp":1096895810000},"page":"377-390","source":"Crossref","is-referenced-by-count":4,"title":["A unified approach to the generation and the acception of formal languages"],"prefix":"10.1007","volume":"9","author":[{"given":"P.","family":"Deussen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"Technical Report","author":"J.R. B\u00fcchi","year":"1959","unstructured":"B\u00fcchi, J.R.: Regular canonical systems and finite automata. University of Michigan. Ann Arbor. Technical Report, 1959"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01969548","volume":"6","author":"J.R. B\u00fcchi","year":"1964","unstructured":"B\u00fcchi, J.R.: Regular canonical systems. Arch. Math. Logik Grundlagenforsch. 6, 91?111 (1964)","journal-title":"Arch. Math. Logik Grundlagenforsch."},{"key":"CR3","volume-title":"PhD. Thesis","author":"R.L. Cannon","year":"1973","unstructured":"Cannon, R.L.: State grammar parsing. PhD. Thesis, Univ. North Carolina. Chapel Hill, 1973"},{"key":"CR4","unstructured":"Deussen, P.: Strategies in acceptors and their relation 10 LR(k)-LL(k)-Theories. Interner Bericht Nr. 8 77. Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe, 1977"},{"key":"CR5","unstructured":"Goos, G.: \u00dcberselzerbau. Manuscript (to be published)"},{"key":"CR6","first-page":"235","volume":"2","author":"G. Hotz","year":"1966","unstructured":"Hotz, G.: Eindeutigkeit und Mehrdeutigkeit formaler Sprachen. Elektron. Informationsverarb. Kybernetik 2. Heft 4, 235?246 (1966)","journal-title":"Elektron. Informationsverarb. Kybernetik"},{"key":"CR7","unstructured":"Hotz, G., Claus, V.: Automatentheorie und formale Sprachen. III. Formale Sprachen. BI, Hochschulskriptum, 1972"},{"key":"CR8","volume-title":"Formal languages and their relation to automata","author":"J.E. Hopcroft","year":"1969","unstructured":"Hopcroft, J.E., Ullman, J.D.: Formal languages and their relation to automata. Reading, Massachusetts: Addison-Wesley 1969"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"Kasai, T.: A hierarchy between context-free and context-sensitive languages. J. Comput. System Sci. 492?508 (1970)","DOI":"10.1016\/S0022-0000(70)80045-9"},{"key":"CR10","unstructured":"Langmaack, H.: Zur \u00c4quivalenz der Hotzschen und Paulschen Definition der Mehrdeutigkeit von Chomsky-Sprachen. In: 4. Kolloquium \u00fcber Automatentheorie, Erlangen, 1967"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF00289518","volume":"1","author":"H. Langmaack","year":"1971","unstructured":"Langmaack, H.: Application of regular canonical systems to grammars translatable from left to right. Acta Informat. 1, 115?138 (1971)","journal-title":"Acta Informat."},{"key":"CR12","volume-title":"3. Kolloquium \u00fcber Automatentheorie","author":"H. Langmaack","year":"1967","unstructured":"Langmaack, H., Eickel, J.: Pr\u00e4zisierung der Begriffe Phrasenstruktur und strukturelle Mehrdeutigkeit in Chomsky-Sprachen. In: 3. Kolloquium \u00fcber Automatentheorie. Basel: Birkh\u00e4user 1967"},{"key":"CR13","unstructured":"Langmaack, H., Schmidt, G.: Klassen unwesentlich verschiedener Ableitungen als Verb\u00e4nde. Tagungsbericht Automatentheorie und Formale Sprachen, BI, 1970"},{"key":"CR14","volume-title":"Introduction to automata","author":"R.J. Nelson","year":"1968","unstructured":"Nelson, R.J.: Introduction to automata. New York: Wiley 1968"},{"key":"CR15","volume-title":"Formal languages","author":"A. Salomaa","year":"1973","unstructured":"Salomaa, A.: Formal languages. New York: Academic Press 1973"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289049.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00289049\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289049","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T17:14:37Z","timestamp":1554743677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00289049"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1978]]}},"alternative-id":["BF00289049"],"URL":"https:\/\/doi.org\/10.1007\/bf00289049","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978]]}}}