On Rough Approximations of Languages under Infinite Index Indiscernibility Relations

DOI10.3233/FI-2021-2024WikidataQ114038164 ScholiaQ114038164MaRDI QIDQ5164858

Gabriela Martín Torres

Publication date: 15 November 2021

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Classification of finite monoids: the language approach
• Rough sets. Mathematical foundations
• On the Accuracy of Rough Approximations of Regular Languages
• Generalized Parikh mappings and homomorphisms
• The Theory of Definite Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Rough Approximations of Languages under Infinite Index Indiscernibility Relations