The full quotient and its closure property for regular languages - Université de La Réunion Access content directly
Journal Articles Information Processing Letters Year : 1998

The full quotient and its closure property for regular languages

Teodor Knapik
  • Function : Author
  • PersonId : 1026004

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.

Keywords

Fichier principal
Vignette du fichier
Full_quotient_and_closure_property_for_regular_languages_hal.pdf (854.84 Ko) Télécharger le fichier
Loading...

Dates and versions

hal-01914801 , version 1 (07-11-2018)

Identifiers

  • HAL Id : hal-01914801 , version 1

Cite

Teodor Knapik, Etienne Payet. The full quotient and its closure property for regular languages. Information Processing Letters, 1998, 65 (2), pp.57-62. ⟨hal-01914801⟩
52 View
163 Download

Share

Gmail Mastodon Facebook X LinkedIn More