Information processing letters, 1998, Vol.65 (2), p.57-62
1998
Volltextzugriff (PDF)
Details
- Autor(en) / Beteiligte
- Titel
- The full quotient and its closure property for regular languages
- Ist Teil von
- Information processing letters, 1998, Vol.65 (2), p.57-62
- Ort / Verlag
- Amsterdam: Elsevier B.V
- Erscheinungsjahr
- 1998
- Quelle
- Alma/SFX Local Collection
- Beschreibungen/Notizen
- 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.
- Sprache
- Englisch
- Identifikatoren
- ISSN: 0020-0190eISSN: 1872-6119DOI: 10.1016/S0020-0190(97)00218-4Titel-ID: cdi_hal_primary_oai_HAL_hal_01914801v1
- Format
- –
- Schlagworte
- Algorithmics. Computability. Computer arithmetics, Algorithms, Applied sciences, Computer programming, Computer Science, Computer science, control theory, systems, Exact sciences and technology, Formal languages, Language theory and syntactical analysis, Languages, Studies, Theoretical computing