@INPROCEEDINGS {WDS11,
   author = {Peter {\v C}erno},
   affiliation = {Department of Computer Science, Charles University, Faculty of Mathematics and Physics, Malostransk{\'e} n{\'a}m. 25, 118 00 PRAHA 1, Czech Republic},
   title = {Learning Automata and Grammars},
   booktitle = {WDS'11 Proceedings of Contributed Papers: Part I – Mathematics and Computer Science},
   editor = {J. Safrankova and J. Pavlu},
   publisher = {Matfyzpress, Prague},
   isbn = {978-80-7378-184-2},
   pages = {125–131},
   abstract = {The problem of learning or inferring automata and grammars has been studied for decades 
               and has connections to many disciplines, including bio-informatics, computational linguistics 
               and pattern recognition. In this paper we present a short survey of basic models and techniques 
               related to the grammatical inference and try to outline some new promising approaches which we 
               expect to bring new light into this subject. For illustration, we introduce delimited string-rewriting 
               systems as a sample model for grammatical inference and sketch the simplified version of the learning 
               algorithm LARS for these systems.},
   year = {2011}
}