{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T07:51:21Z","timestamp":1715241081839},"reference-count":4,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2003,12]]},"abstract":"<jats:p>Linear conjunctive grammars have recently been proved computationally equivalent to triangular trellis automata. The relation between these grammars and these automata resembles that between regular expressions and finite automata: while the former are better suited for human use, the latter are considerably easier to implement. This paper studies efficient algorithms for converting a linear conjunctive grammar to an equivalent triangular trellis automaton, and also proposes a number of techniques of reducing the size of these automata.<\/jats:p>","DOI":"10.1142\/s0129054103002205","type":"journal-article","created":{"date-parts":[[2003,12,19]],"date-time":"2003-12-19T05:51:21Z","timestamp":1071813081000},"page":"1103-1116","source":"Crossref","is-referenced-by-count":4,"title":["EFFICIENT AUTOMATON-BASED RECOGNITION FOR LINEAR CONJUNCTIVE LANGUAGES"],"prefix":"10.1142","volume":"14","author":[{"given":"ALEXANDER","family":"OKHOTIN","sequence":"first","affiliation":[{"name":"School of Computing, Queen's University, Kingston, Ontario, Canada K7L 3N6, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","volume-title":"Compilers: principles, techniques and tools","author":"Aho A. V.","year":"1986"},{"key":"rf2","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/BF00264617","volume":"21","author":"Choffrut C.","journal-title":"Acta Informatica"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(80)90164-3"},{"key":"rf5","first-page":"519","volume":"6","author":"Okhotin A.","journal-title":"Journal of Automata, Languages and Combinatorics"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054103002205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,28]],"date-time":"2020-03-28T05:57:13Z","timestamp":1585375033000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054103002205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":4,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2003,12]]}},"alternative-id":["10.1142\/S0129054103002205"],"URL":"https:\/\/doi.org\/10.1142\/s0129054103002205","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}