https://hal.univ-reunion.fr/hal-01914801Knapik, TeodorTeodorKnapikUNC - Université de la Nouvelle-CalédoniePayet, EtienneEtiennePayetLIM - Laboratoire d'Informatique et de Mathématiques - UR - Université de La RéunionThe full quotient and its closure property for regular languagesHAL CCSD1998Formal languages[INFO] Computer Science [cs]Univ, Réunion2018-11-07 10:48:532022-06-26 13:43:252018-11-23 07:03:14enJournal articlesapplication/pdf1A new operation on languages, called the full quotient, is defined. The closure property for regular languages under this operation is established. An algorithm is given that constructs a finite automaton recognizing the full quotient of two regular languages. The time complexity of the algorithm is proportional to the product of the number of states of the input automata. Several additional properties of the full quotient are investigated.