Rough-set-like approximation spaces for formal languages

MaRDI QIDQ5867517zbMATH OpenFDO

Authors Péter Battyányi, Tamás Mihálydeák, György Vaszil

Publication date 14 September 2022

Full work available at URL http://www.jalc.de/issues/2022/issue_27_1-3/jalc-2022-079-090.php

zbMATH Keywords

language approximationrough finite state automatonrough grammarrough language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1123618
• On the accuracy of rough approximations of regular languages
• Rough approximations in varieties of regular languages
• scientific article; zbMATH DE number 3909761
• Rough grammar and rough language

Cites work

• A general set theoretic approximation framework
• Covering based rough set approximations
• scientific article; zbMATH DE number 53312 (Why is no real title available?)
• scientific article; zbMATH DE number 1123618 (Why is no real title available?)
• scientific article; zbMATH DE number 927110 (Why is no real title available?)
• On minimization of deterministic automaton with rough output
• On the accuracy of rough approximations of regular languages
• Rough approximations in varieties of regular languages
• ROUGH FINITE-STATE AUTOMATA
• Rough sets
• Rough sets and Boolean reasoning
• Rudiments of rough sets
• Similarity Based Rough Sets

Cited in

(2)

• scientific article; zbMATH DE number 1123618 (Why is no real title available?)
• On Rough Approximations of Languages under Infinite Index Indiscernibility Relations

This page was built for publication: Rough-set-like approximation spaces for formal languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5867517)