The full quotient and its closure property for regular languages
Abstract
A 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.
Domains
Computer Science [cs]
Fichier principal
Full_quotient_and_closure_property_for_regular_languages_hal.pdf (854)
Télécharger le fichier
Loading...