On Rough Approximations of Languages under Infinite Index Indiscernibility Relations
From MaRDI portal
Publication:5164858
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
- scientific article; zbMATH DE number 4028925 (Why is no real title available?)
- scientific article; zbMATH DE number 53312 (Why is no real title available?)
- scientific article; zbMATH DE number 3495598 (Why is no real title available?)
- scientific article; zbMATH DE number 1123618 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 3238653 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- scientific article; zbMATH DE number 3415406 (Why is no real title available?)
- scientific article; zbMATH DE number 3189697 (Why is no real title available?)
- Characterization of a word by its subwords
- Classification of finite monoids: the language approach
- Generalized Parikh mappings and homomorphisms
- On the accuracy of rough approximations of regular languages
- Rough approximations in varieties of regular languages
- Rough sets. Mathematical foundations
- The Theory of Definite Automata
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)
