1. T. Aizikowitz and M. Kaminski, LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata.Comput. Sci. Russia(CSR 2011, St. Petersburg, Russia, 14–18 June 2011). Vol. 6651 ofLect. Notes Comput. Sci.(2011) 345–358.
2. M. Barash, Recursive descent parsing for grammars with contexts.SOFSEM 2013 student research forum Špindlerův Mlýn, Czech Republic, 26-31 January, 2013. Local Proceedings II, 10–21, Institute of Computer Science AS CR (2013).
3. M. Barash, Programming language specification by a grammar with contexts. InFifth Workshop on Non-Classical Models of Automata and Applications, NCMA 2013, Umeå, Sweden, 13–14 August, 2013, edited by S. Bensch, F. Drewes, R. Freund, F. Otto. books@ocg.at 294, Österreichische Computer Gesellschaft (2013) 51–67. http://users.utu.fi/mikbar/kieli/
4. Barash M. and Okhotin A., An extension of context-free grammars with one-sided context specifications.Inform. Comput.237(2014) 268–293.
5. M. Barash and A. Okhotin, Linear grammars with one-sided contexts and their automaton representation.LATIN 2014: Theoretical Informatics, Montevideo,Uruguay, 31 March–4 April 2014. In vol. 8392, Lect. Notes Comput. Sci. (2014) 190–201.