Minimal cover-automata for finite languages

被引：48
|
作者：
Câmpeanu, C [1 ]
Sântean, N [1 ]
Yu, S [1 ]
机构：
[1] Univ Western Ontario, Middlesex Coll, Dept Comp Sci, London, ON N6A 5B7, Canada
来源：
THEORETICAL COMPUTER SCIENCE | 2001年 / 267卷 / 1-2期
基金：
加拿大自然科学与工程研究理事会;
关键词：
finite languages; deterministic finite automata; cover language; deterministic cover automata;
D O I：
10.1016/S0304-3975(00)00292-9
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A cover-automaton A of a finite language L subset of or equal to Sigma* is a finite deterministic automaton (DFA) that accepts all words in L and possibly other words that are longer than any word in L. A minimal deterministic finite cover automaton (DFCA) of a finite language L usually has a smaller size than a minimal DFA that accept L. Thus, cover automata can be used to reduce the size of the representations of finite languages in practice. In this paper, we describe an efficient algorithm that, for a given DFA accepting a finite language, constructs a minimal deterministic finite cover-automaton of the language. We also give algorithms for the boolean operations on deterministic cover automata, i.e., on the finite languages they represent. (C) 2001 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：3 / 16
页数：14
相关论文
共 50 条
  • [31] Rough Finite State Automata and Rough Languages
    Arulprakasam, R.
    Perumal, R.
    Radhakrishnan, M.
    Dare, V. R.
    PROCEEDINGS OF THE 10TH NATIONAL CONFERENCE ON MATHEMATICAL TECHNIQUES AND ITS APPLICATIONS (NCMTA 18), 2018, 1000
  • [32] REPRESENTABILITY OF NONREGULAR LANGUAGES IN FINITE PROBABILISTIC AUTOMATA
    KNAST, R
    INFORMATION AND CONTROL, 1970, 16 (03): : 285 - &
  • [33] LANGUAGES RECOGNIZED BY NONDETERMINISTIC QUANTUM FINITE AUTOMATA
    Yakaryilmaz, Abuzer
    Say, A. C. Cem
    QUANTUM INFORMATION & COMPUTATION, 2010, 10 (9-10) : 747 - 770
  • [34] Lattice-valued finite automata and their languages
    Li, YM
    8TH WORLD MULTI-CONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL XIV, PROCEEDINGS: COMPUTER AND INFORMATION SYSTEMS, TECHNOLOGIES AND APPLICATIONS, 2004, : 213 - 218
  • [35] SCANNING REGULAR LANGUAGES BY DUAL FINITE AUTOMATA
    WU, PC
    WANG, FJ
    YOUNG, KR
    SIGPLAN NOTICES, 1992, 27 (04): : 12 - 16
  • [36] 2 ω-finite automata and sets of obstructions of their languages
    B. F. Melnikov
    Korean Journal of Computational & Applied Mathematics, 1999, 6 (3) : 565 - 574
  • [37] Learning finite cover automata from queries
    Ipate, Florentin
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2012, 78 (01) : 221 - 244
  • [38] Non-Deterministic Finite Cover Automata
    Campeanu, Cezar
    SCIENTIFIC ANNALS OF COMPUTER SCIENCE, 2015, 25 (01) : 3 - 28
  • [39] More on deterministic and nondeterministic finite cover automata
    Gruber, Hermann
    Holzer, Markus
    Jakobi, Sebastian
    THEORETICAL COMPUTER SCIENCE, 2017, 679 : 18 - 30
  • [40] On Minimal Grammar Problems for Finite Languages
    Gruber, Hermann
    Holzer, Markus
    Wolfsteiner, Simon
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2018, 2018, 11088 : 342 - 353
12345