Display title | Rational set |
Default sort key | Rational set |
Page length (in bytes) | 6,907 |
Namespace ID | 0 |
Page ID | 218664 |
Page content language | en - English |
Page content model | wikitext |
Indexing by robots | Allowed |
Number of redirects to this page | 0 |
Counted as a content page | Yes |
HandWiki item ID | None |
Edit | Allow all users (infinite) |
Move | Allow all users (infinite) |
Page creator | imported>BotanyGa |
Date of page creation | 20:30, 27 September 2021 |
Latest editor | imported>BotanyGa |
Date of latest edit | 20:30, 27 September 2021 |
Total number of edits | 1 |
Recent number of edits (within past 90 days) | 0 |
Recent number of distinct authors | 0 |
Description | Content |
Article description: (description ) This attribute controls the content of the description and og:description elements. | In computer science, more precisely in automata theory, a rational set of a monoid is an element of the minimal class of subsets of this monoid that contains all finite subsets and is closed under union, product and Kleene star. Rational sets are useful in automata theory, formal languages and algebra... |