On the classes of languages accepted by limited context restarting automata.
RAIRO Theor. Informatics Appl., 2014
Grammatical inference of lambda-confluent context rewriting systems.
Proceedings of the Fifth Workshop on Non-Classical Models for Automata and Applications - NCMA 2013, Umeå, Sweden, August 13, 2013
Clearing Restarting Automata and Grammatical Inference.
Proceedings of the Eleventh International Conference on Grammatical Inference, 2012
Limited Context Restarting Automata and McNaughton Families of Languages.
Proceedings of the Fourth Workshop on Non-Classical Models for Automata and Applications, 2012
Δ-Clearing Restarting Automata and CFL \makebox{\sf CFL}.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011
Clearing Restarting Automata.
Fundam. Informaticae, 2010