See coaccessible in All languages combined, or Wiktionary
{
"categories": [
{
"kind": "other",
"name": "Adjektiv (Englisch)",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Anagramm sortiert (Englisch)",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Englisch",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Rückläufige Wörterliste (Englisch)",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Siehe auch",
"orig": "siehe auch",
"parents": [],
"source": "w"
}
],
"forms": [
{
"form": "coaccessible",
"tags": [
"positive"
]
}
],
"hyphenation": "co·ac·ces·si·ble",
"lang": "Englisch",
"lang_code": "en",
"pos": "adj",
"senses": [
{
"examples": [
{
"accessdate": "2014-05-18",
"author": "Christos G. Cassandras, Stéphane Lafortune",
"edition": "2.",
"isbn": "978-0-387-33332-8",
"pages": "102",
"place": "New York",
"publisher": "Springer",
"ref": "Christos G. Cassandras, Stéphane Lafortune: Introduction to Discrete Event Systems. 2. Auflage. Springer, New York 2008, ISBN 978-0-387-33332-8, Seite 102 (zitiert nach Google Books, abgerufen am 18. Mai 2014)",
"text": "“For this purpose, we can start by finding all the states of G that are not coaccessible.”",
"title": "Introduction to Discrete Event Systems",
"url": "zitiert nachGoogle Books",
"year": "2008"
},
{
"accessdate": "2014-05-18",
"author": "Mark V. Lawson",
"isbn": "1-58488-255-7",
"pages": "73",
"place": "Boca Raton",
"publisher": "Chapman & Hall/CRC",
"ref": "Mark V. Lawson: Finite Automata. Chapman & Hall/CRC, Boca Raton 2004, ISBN 1-58488-255-7, Seite 73 (zitiert nach Google Books, abgerufen am 18. Mai 2014)",
"text": "“The algorithm for finding the coaccessible states is simply a variant of the one for finding the accessible states.”",
"title": "Finite Automata",
"url": "zitiert nachGoogle Books",
"year": "2004"
},
{
"accessdate": "2014-05-18",
"author": "Dominique Perrin, Jean Éric Pin",
"isbn": "0-12-532111-2",
"pages": "28",
"place": "Amsterdam",
"publisher": "Elsevier",
"ref": "Dominique Perrin, Jean Éric Pin: Infinite Words. Automata, Semigroups, Logic and Games. Elsevier, Amsterdam 2004, ISBN 0-12-532111-2, Seite 28 (zitiert nach Google Books, abgerufen am 18. Mai 2014)",
"text": "“Thus, the initial state is coaccessible and I ∩ P is a singleton.”",
"title": "Infinite Words",
"title_complement": "Automata, Semigroups, Logic and Games",
"url": "zitiert nachGoogle Books",
"year": "2004"
},
{
"accessdate": "2014-05-18",
"author": "Stephen L. Bloom, Zoltán Ésik",
"collection": "Mathematical Foundations of Programming Semantics",
"editor": "Stephen Brookes et al.",
"isbn": "3-540-58027-1",
"pages": "399",
"place": "Berlin/Heidelberg/New York",
"publisher": "Springer",
"ref": "Stephen L. Bloom, Zoltán Ésik: Some Quasi-Varieties of Iteration Theories. In: Stephen Brookes et al. (Herausgeber): Mathematical Foundations of Programming Semantics. Springer, Berlin/Heidelberg/New York 1994, ISBN 3-540-58027-1, Seite 399 (zitiert nach Google Books, abgerufen am 18. Mai 2014)",
"text": "“Note that the set of accessible or coaccessible states in M are exactly those in M′.”",
"title": "Some Quasi-Varieties of Iteration Theories",
"url": "zitiert nachGoogle Books",
"year": "1994"
}
],
"glosses": [
"so beschaffen, dass es mindestens einen Pfad (Folge von Übergängen) zu einem Endzustand gibt"
],
"id": "de-coaccessible-en-adj-pCg8a7Zm",
"raw_tags": [
"Automatentheorie",
"von einem Zustand eines Automaten"
],
"sense_index": "1",
"topics": [
"computing"
]
}
],
"word": "coaccessible"
}
{
"categories": [
"Adjektiv (Englisch)",
"Anagramm sortiert (Englisch)",
"Englisch",
"Rückläufige Wörterliste (Englisch)",
"siehe auch"
],
"forms": [
{
"form": "coaccessible",
"tags": [
"positive"
]
}
],
"hyphenation": "co·ac·ces·si·ble",
"lang": "Englisch",
"lang_code": "en",
"pos": "adj",
"senses": [
{
"examples": [
{
"accessdate": "2014-05-18",
"author": "Christos G. Cassandras, Stéphane Lafortune",
"edition": "2.",
"isbn": "978-0-387-33332-8",
"pages": "102",
"place": "New York",
"publisher": "Springer",
"ref": "Christos G. Cassandras, Stéphane Lafortune: Introduction to Discrete Event Systems. 2. Auflage. Springer, New York 2008, ISBN 978-0-387-33332-8, Seite 102 (zitiert nach Google Books, abgerufen am 18. Mai 2014)",
"text": "“For this purpose, we can start by finding all the states of G that are not coaccessible.”",
"title": "Introduction to Discrete Event Systems",
"url": "zitiert nachGoogle Books",
"year": "2008"
},
{
"accessdate": "2014-05-18",
"author": "Mark V. Lawson",
"isbn": "1-58488-255-7",
"pages": "73",
"place": "Boca Raton",
"publisher": "Chapman & Hall/CRC",
"ref": "Mark V. Lawson: Finite Automata. Chapman & Hall/CRC, Boca Raton 2004, ISBN 1-58488-255-7, Seite 73 (zitiert nach Google Books, abgerufen am 18. Mai 2014)",
"text": "“The algorithm for finding the coaccessible states is simply a variant of the one for finding the accessible states.”",
"title": "Finite Automata",
"url": "zitiert nachGoogle Books",
"year": "2004"
},
{
"accessdate": "2014-05-18",
"author": "Dominique Perrin, Jean Éric Pin",
"isbn": "0-12-532111-2",
"pages": "28",
"place": "Amsterdam",
"publisher": "Elsevier",
"ref": "Dominique Perrin, Jean Éric Pin: Infinite Words. Automata, Semigroups, Logic and Games. Elsevier, Amsterdam 2004, ISBN 0-12-532111-2, Seite 28 (zitiert nach Google Books, abgerufen am 18. Mai 2014)",
"text": "“Thus, the initial state is coaccessible and I ∩ P is a singleton.”",
"title": "Infinite Words",
"title_complement": "Automata, Semigroups, Logic and Games",
"url": "zitiert nachGoogle Books",
"year": "2004"
},
{
"accessdate": "2014-05-18",
"author": "Stephen L. Bloom, Zoltán Ésik",
"collection": "Mathematical Foundations of Programming Semantics",
"editor": "Stephen Brookes et al.",
"isbn": "3-540-58027-1",
"pages": "399",
"place": "Berlin/Heidelberg/New York",
"publisher": "Springer",
"ref": "Stephen L. Bloom, Zoltán Ésik: Some Quasi-Varieties of Iteration Theories. In: Stephen Brookes et al. (Herausgeber): Mathematical Foundations of Programming Semantics. Springer, Berlin/Heidelberg/New York 1994, ISBN 3-540-58027-1, Seite 399 (zitiert nach Google Books, abgerufen am 18. Mai 2014)",
"text": "“Note that the set of accessible or coaccessible states in M are exactly those in M′.”",
"title": "Some Quasi-Varieties of Iteration Theories",
"url": "zitiert nachGoogle Books",
"year": "1994"
}
],
"glosses": [
"so beschaffen, dass es mindestens einen Pfad (Folge von Übergängen) zu einem Endzustand gibt"
],
"raw_tags": [
"Automatentheorie",
"von einem Zustand eines Automaten"
],
"sense_index": "1",
"topics": [
"computing"
]
}
],
"word": "coaccessible"
}
Download raw JSONL data for coaccessible meaning in Englisch (3.0kB)
This page is a part of the kaikki.org machine-readable Englisch dictionary. This dictionary is based on structured data extracted on 2025-01-27 from the dewiktionary dump dated 2025-01-20 using wiktextract (c7bdf0e and 5c11237). 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.