@article{Joshi_etal_TAG:1975,
	title = {Tree adjunct grammars},
	volume = {10},
	issn = {0022-0000},
	url = {https://www.sciencedirect.com/science/article/pii/S0022000075800195},
	doi = {10.1016/S0022-0000(75)80019-5},
	abstract = {In this paper, a tree generating system called a tree adjunct grammar is described and its formal properties are studied relating them to the tree generating systems of Brainerd (Information and Control 14 (1969), 217–231) and Rounds (Mathematical Systems Theory 4 (1970), 257–287) and to the recognizable sets and local sets discussed by Thatcher (Journal of Computer and System Sciences 1 (1967), 317–322; 4 (1970), 339–367) and Rounds. Linguistic relevance of these systems has been briefly discussed also.},
	language = {en},
	number = {1},
	urldate = {2021-04-28},
	journal = {Journal of Computer and System Sciences},
	author = {Joshi, Aravind K. and Levy, Leon S. and Takahashi, Masako},
	month = feb,
	year = {1975},
	pages = {136--163},
}

{"_id":"eDzKtgrZMjEzJehPg","bibbaseid":"joshi-levy-takahashi-treeadjunctgrammars-1975","author_short":["Joshi, A. K.","Levy, L. S.","Takahashi, M."],"bibdata":{"bibtype":"article","type":"article","title":"Tree adjunct grammars","volume":"10","issn":"0022-0000","url":"https://www.sciencedirect.com/science/article/pii/S0022000075800195","doi":"10.1016/S0022-0000(75)80019-5","abstract":"In this paper, a tree generating system called a tree adjunct grammar is described and its formal properties are studied relating them to the tree generating systems of Brainerd (Information and Control 14 (1969), 217–231) and Rounds (Mathematical Systems Theory 4 (1970), 257–287) and to the recognizable sets and local sets discussed by Thatcher (Journal of Computer and System Sciences 1 (1967), 317–322; 4 (1970), 339–367) and Rounds. Linguistic relevance of these systems has been briefly discussed also.","language":"en","number":"1","urldate":"2021-04-28","journal":"Journal of Computer and System Sciences","author":[{"propositions":[],"lastnames":["Joshi"],"firstnames":["Aravind","K."],"suffixes":[]},{"propositions":[],"lastnames":["Levy"],"firstnames":["Leon","S."],"suffixes":[]},{"propositions":[],"lastnames":["Takahashi"],"firstnames":["Masako"],"suffixes":[]}],"month":"February","year":"1975","pages":"136–163","bibtex":"@article{Joshi_etal_TAG:1975,\n\ttitle = {Tree adjunct grammars},\n\tvolume = {10},\n\tissn = {0022-0000},\n\turl = {https://www.sciencedirect.com/science/article/pii/S0022000075800195},\n\tdoi = {10.1016/S0022-0000(75)80019-5},\n\tabstract = {In this paper, a tree generating system called a tree adjunct grammar is described and its formal properties are studied relating them to the tree generating systems of Brainerd (Information and Control 14 (1969), 217–231) and Rounds (Mathematical Systems Theory 4 (1970), 257–287) and to the recognizable sets and local sets discussed by Thatcher (Journal of Computer and System Sciences 1 (1967), 317–322; 4 (1970), 339–367) and Rounds. Linguistic relevance of these systems has been briefly discussed also.},\n\tlanguage = {en},\n\tnumber = {1},\n\turldate = {2021-04-28},\n\tjournal = {Journal of Computer and System Sciences},\n\tauthor = {Joshi, Aravind K. and Levy, Leon S. and Takahashi, Masako},\n\tmonth = feb,\n\tyear = {1975},\n\tpages = {136--163},\n}\n\n","author_short":["Joshi, A. K.","Levy, L. S.","Takahashi, M."],"key":"Joshi_etal_TAG:1975","id":"Joshi_etal_TAG:1975","bibbaseid":"joshi-levy-takahashi-treeadjunctgrammars-1975","role":"author","urls":{"Paper":"https://www.sciencedirect.com/science/article/pii/S0022000075800195"},"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"https://bibbase.org/zotero/ValentinDRichard","dataSources":["nTukRxsNNmbKgjGgn"],"keywords":[],"search_terms":["tree","adjunct","grammars","joshi","levy","takahashi"],"title":"Tree adjunct grammars","year":1975}