Caratheodory Extensions of Subclasses of Regular Languages

被引:2
|
作者
Sin'ya, Ryoma [1 ]
机构
[1] Akita Univ, Akita, Japan
来源
关键词
D O I
10.1007/978-3-030-81508-0_29
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A language L is said to be regular measurable if there exists an infinite sequence of regular languages that "converges" to L. In [13], the author showed that, while many complex context-free languages are regular measurable, the set of all primitive words and certain deterministic context-free languages are regular immeasurable. This paper investigates general properties of measurability, including closure properties, decidability and different characterisation. Further, for a suitable subclass C of regular languages, we show that the class of all C-measurable regular languages has a good algebraic structure.
引用
收藏
页码:355 / 367
页数:13
相关论文
共 50 条
  • [1] Regular splicing languages and subclasses
    Bonizzoni, P
    Mauri, G
    THEORETICAL COMPUTER SCIENCE, 2005, 340 (02) : 349 - 363
  • [2] Extensions of ω-Regular Languages
    Bojanczyk, Mikolaj
    Kelmendi, Edon
    Stefanski, Rafal
    Zetzsche, Georg
    PROCEEDINGS OF THE 35TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2020), 2020, : 266 - 272
  • [3] Conservative extensions of regular languages
    Bouchou, B
    Duarte, D
    Alves, MHF
    Laurent, D
    Musicante, MA
    SCCC 2004: XXIV INTERNATIONAL CONFERENCE OF THE CHILEAN COMPUTER SCIENCE SOCIETY, 2004, : 99 - 109
  • [4] Generating, Sampling and Counting Subclasses of Regular Tree Languages
    Timos Antonopoulos
    Floris Geerts
    Wim Martens
    Frank Neven
    Theory of Computing Systems, 2013, 52 : 542 - 585
  • [5] Deterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages
    Arulprakasam, R.
    Dare, V. R.
    Gnanasekaran, S.
    IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS, 2019, 14 (01): : 1 - 11
  • [6] Generating, Sampling and Counting Subclasses of Regular Tree Languages
    Antonopoulos, Timos
    Geerts, Floris
    Martens, Wim
    Neven, Frank
    THEORY OF COMPUTING SYSTEMS, 2013, 52 (03) : 542 - 585
  • [7] LOGICAL FORMULAS AND 4 SUBCLASSES OF OMEGA-REGULAR LANGUAGES
    KOBAYASHI, K
    TAKAHASHI, M
    YAMASAKI, H
    LECTURE NOTES IN COMPUTER SCIENCE, 1985, 192 : 81 - 88
  • [8] Inferring subclasses of regular languages faster using RPNI and forbidden configurations
    Cano, A
    Ruiz, J
    García, P
    GRAMMATICAL INFERENCE: ALGORITHMS AND APPLIICATIONS, 2002, 2484 : 28 - 36
  • [10] Controlled extensions of Caratheodory functions
    Kubinska, E.
    JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 2007, 328 (02) : 1007 - 1012