See bireversible on Wiktionary
{ "etymology_templates": [ { "args": { "1": "en", "2": "bi", "3": "reversible" }, "expansion": "bi- + reversible", "name": "prefix" } ], "etymology_text": "From bi- + reversible.", "head_templates": [ { "args": { "1": "-" }, "expansion": "bireversible (not comparable)", "name": "en-adj" } ], "lang": "English", "lang_code": "en", "pos": "adj", "senses": [ { "categories": [ { "kind": "other", "name": "English entries with incorrect language header", "parents": [ "Entries with incorrect language header", "Entry maintenance" ], "source": "w" }, { "kind": "other", "name": "English terms prefixed with bi-", "parents": [], "source": "w" }, { "kind": "other", "name": "Pages with 1 entry", "parents": [], "source": "w" }, { "kind": "other", "name": "Pages with entries", "parents": [], "source": "w" }, { "kind": "topical", "langcode": "en", "name": "Mathematics", "orig": "en:Mathematics", "parents": [ "Formal sciences", "Sciences", "All topics", "Fundamental" ], "source": "w" } ], "examples": [ { "ref": "2016, Thibault Godin, Ines Klimann, “Connected reversible Mealy automata of prime size cannot generate infinite Burnside groups”, in arXiv:", "text": "It has been proved that, for a connected automaton of size at most~3, or when the automaton is not bireversible, the generated group cannot be Burnside infinite.", "type": "quote" } ], "glosses": [ "reversible under the action of two linear involutions" ], "id": "en-bireversible-en-adj-PSU3LS7U", "links": [ [ "mathematics", "mathematics" ], [ "reversible", "reversible" ], [ "linear", "linear" ], [ "involution", "involution" ] ], "raw_glosses": [ "(mathematics) reversible under the action of two linear involutions" ], "tags": [ "not-comparable" ], "topics": [ "mathematics", "sciences" ] } ], "word": "bireversible" }
{ "etymology_templates": [ { "args": { "1": "en", "2": "bi", "3": "reversible" }, "expansion": "bi- + reversible", "name": "prefix" } ], "etymology_text": "From bi- + reversible.", "head_templates": [ { "args": { "1": "-" }, "expansion": "bireversible (not comparable)", "name": "en-adj" } ], "lang": "English", "lang_code": "en", "pos": "adj", "senses": [ { "categories": [ "English adjectives", "English entries with incorrect language header", "English lemmas", "English terms prefixed with bi-", "English terms with quotations", "English uncomparable adjectives", "Pages with 1 entry", "Pages with entries", "en:Mathematics" ], "examples": [ { "ref": "2016, Thibault Godin, Ines Klimann, “Connected reversible Mealy automata of prime size cannot generate infinite Burnside groups”, in arXiv:", "text": "It has been proved that, for a connected automaton of size at most~3, or when the automaton is not bireversible, the generated group cannot be Burnside infinite.", "type": "quote" } ], "glosses": [ "reversible under the action of two linear involutions" ], "links": [ [ "mathematics", "mathematics" ], [ "reversible", "reversible" ], [ "linear", "linear" ], [ "involution", "involution" ] ], "raw_glosses": [ "(mathematics) reversible under the action of two linear involutions" ], "tags": [ "not-comparable" ], "topics": [ "mathematics", "sciences" ] } ], "word": "bireversible" }
Download raw JSONL data for bireversible meaning in All languages combined (1.3kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-12-21 from the enwiktionary dump dated 2024-12-04 using wiktextract (d8cb2f3 and 4e554ae). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.