{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T00:29:46Z","timestamp":1675124986715},"reference-count":6,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2006,10]]},"abstract":"<jats:p> This paper introduces and discusses #-rewriting systems, which represent language-generating devices that resemble automata by using finitely many states without any nonterminals. It demonstrates that these systems characterize the well-known infinite hierarchy of language families resulting from programmed grammars of finite index in a very natural way. In its conclusion, this paper suggests some variants of #-rewriting systems. <\/jats:p>","DOI":"10.1142\/s0129054106004352","type":"journal-article","created":{"date-parts":[[2006,9,18]],"date-time":"2006-09-18T12:04:43Z","timestamp":1158581083000},"page":"1223-1229","source":"Crossref","is-referenced-by-count":3,"title":["GENERATION OF LANGUAGES BY REWRITING SYSTEMS THAT RESEMBLE AUTOMATA"],"prefix":"10.1142","volume":"17","author":[{"given":"ZBYN\u011aK","family":"K\u0158IVKA","sequence":"first","affiliation":[{"name":"Faculty of Information Technologies, Brno University of Technology, Bo\u017eet\u011bchova 2, 612 66 Brno, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ALEXANDER","family":"MEDUNA","sequence":"additional","affiliation":[{"name":"Faculty of Information Technologies, Brno University of Technology, Bo\u017eet\u011bchova 2, 612 66 Brno, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"RUDOLF","family":"SCH\u00d6NECKER","sequence":"additional","affiliation":[{"name":"Faculty of Information Technologies, Brno University of Technology, Bo\u017eet\u011bchova 2, 612 66 Brno, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1080\/00207169408804310"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74932-2"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(70)80045-9"},{"key":"rf5","volume-title":"Automata and Languages, Theory and Applications","author":"Meduna A.","year":"2000"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.12.029"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59126-6"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054106004352","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:40:50Z","timestamp":1565138450000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054106004352"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10]]},"references-count":6,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2006,10]]}},"alternative-id":["10.1142\/S0129054106004352"],"URL":"https:\/\/doi.org\/10.1142\/s0129054106004352","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,10]]}}}