On Rough Approximations of Languages under Infinite Index Indiscernibility Relations
From MaRDI portal
Publication:5164858
DOI10.3233/FI-2021-2024WikidataQ114038164 ScholiaQ114038164MaRDI QIDQ5164858FDOQ5164858
Authors: Gabriela Martín Torres 
Publication date: 15 November 2021
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Recommendations
- Finite Approximations and Similarity of Languages
- On infinite words determined by indexed languages
- On the accuracy of rough approximations of regular languages
- scientific article; zbMATH DE number 1123618
- scientific article; zbMATH DE number 176766
- scientific article; zbMATH DE number 4035177
- Rough-set-like approximation spaces for formal languages
- A new pumping lemma for indexed languages, with an application to infinite words
- Rational index of languages with bounded dimension of parse trees
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Classification of finite monoids: the language approach
- Generalized Parikh mappings and homomorphisms
- Rough sets. Mathematical foundations
- Characterization of a word by its subwords
- Title not available (Why is that?)
- The Theory of Definite Automata
- Rough approximations in varieties of regular languages
- On the accuracy of rough approximations of regular languages
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: On Rough Approximations of Languages under Infinite Index Indiscernibility Relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5164858)
