See co-accessible 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"
}
],
"derived": [
{
"word": "co-accessibility"
}
],
"forms": [
{
"form": "co-accessible",
"tags": [
"positive"
]
}
],
"hyphenation": "co-ac·ces·si·ble",
"lang": "Englisch",
"lang_code": "en",
"pos": "adj",
"senses": [
{
"examples": [
{
"accessdate": "2014-05-15",
"author": "James Andrew Anderson",
"isbn": "978-0-521-84887-9",
"pages": "73",
"place": "Cambridge",
"publisher": "Cambridge University Press",
"ref": "James Andrew Anderson: Automata Theory with Modern Applications. Cambridge University Press, Cambridge 2006, ISBN 978-0-521-84887-9, Seite 73 (zitiert nach bib.tiera.ru [PDF], abgerufen am 15. Mai 2014)",
"text": "“To find the co-accessible states, reverse the arrows and begin with the acceptance states.”",
"title": "Automata Theory with Modern Applications",
"url": "zitiert nachbib.tiera.ru [PDF]",
"year": "2006"
},
{
"accessdate": "2014-05-15",
"author": "Jacques Sakarovitch",
"isbn": "978-0-521-84425-3",
"pages": "67",
"place": "Cambridge",
"publisher": "Cambridge University Press",
"ref": "Jacques Sakarovitch: Elements of Automata Theory. Cambridge University Press, Cambridge 2009, ISBN 978-0-521-84425-3, Seite 67 (zitiert nach Google Books, abgerufen am 15. Mai 2014)",
"text": "“We will say that a state p is useful if it is both accessible and co-accessible.”",
"title": "Elements of Automata Theory",
"url": "zitiert nachGoogle Books",
"year": "2009"
},
{
"accessdate": "2014-05-15",
"author": "Hugues Chabot, Raphael Khoury, Nadia Tawbi",
"collection": "Identity and Privacy in the Internet Age",
"editor": "Audun Jøsang, Torleiv Maseng, Svein Johan Knapskog",
"isbn": "978-3-642-04765-7",
"pages": "290",
"place": "Berlin/Heidelberg",
"publisher": "Springer",
"ref": "Hugues Chabot, Raphael Khoury, Nadia Tawbi: Generating In-Line Monitors for Rabin Automata. In: Audun Jøsang, Torleiv Maseng, Svein Johan Knapskog (Herausgeber): Identity and Privacy in the Internet Age. Springer, Berlin/Heidelberg 2009, ISBN 978-3-642-04765-7, Seite 290 (zitiert nach Google Books, abgerufen am 15. Mai 2014)",
"text": "“In this figure, all the states are accessible and co-accessible.”",
"title": "Generating In-Line Monitors for Rabin Automata",
"url": "zitiert nachGoogle Books",
"year": "2009"
},
{
"accessdate": "2014-05-15",
"author": "Johannes Bubenzer, Kay-Michael Würzner",
"collection": "Finite-State Methods and Natural Language Processing",
"editor": "Anssi Yli-Jyrä, András Kornai, Jacques Sakarovitch, Bruce Watson",
"isbn": "978-3-642-14683-1",
"pages": "99",
"place": "Berlin/Heidelberg",
"publisher": "Springer",
"ref": "Johannes Bubenzer, Kay-Michael Würzner: Joining Composition and Trimming of Finite-State Transducers. In: Anssi Yli-Jyrä, András Kornai, Jacques Sakarovitch, Bruce Watson (Herausgeber): Finite-State Methods and Natural Language Processing. Springer, Berlin/Heidelberg 2010, ISBN 978-3-642-14683-1, Seite 99 (zitiert nach Google Books, abgerufen am 15. Mai 2014)",
"text": "“The only difference is that it may remain unknown for some state (p₁,p₂) whether it is co-accessible or not even after all its transitions have been processed.”",
"title": "Joining Composition and Trimming of Finite-State Transducers",
"url": "zitiert nachGoogle Books",
"year": "2010"
}
],
"glosses": [
"so beschaffen, dass es mindestens einen Pfad (Folge von Übergängen) zu einem Endzustand gibt"
],
"id": "de-co-accessible-en-adj-pCg8a7Zm",
"raw_tags": [
"Automatentheorie",
"von einem Zustand eines Automaten"
],
"sense_index": "1",
"topics": [
"computing"
]
}
],
"word": "co-accessible"
}
{
"categories": [
"Adjektiv (Englisch)",
"Anagramm sortiert (Englisch)",
"Englisch",
"Rückläufige Wörterliste (Englisch)",
"siehe auch"
],
"derived": [
{
"word": "co-accessibility"
}
],
"forms": [
{
"form": "co-accessible",
"tags": [
"positive"
]
}
],
"hyphenation": "co-ac·ces·si·ble",
"lang": "Englisch",
"lang_code": "en",
"pos": "adj",
"senses": [
{
"examples": [
{
"accessdate": "2014-05-15",
"author": "James Andrew Anderson",
"isbn": "978-0-521-84887-9",
"pages": "73",
"place": "Cambridge",
"publisher": "Cambridge University Press",
"ref": "James Andrew Anderson: Automata Theory with Modern Applications. Cambridge University Press, Cambridge 2006, ISBN 978-0-521-84887-9, Seite 73 (zitiert nach bib.tiera.ru [PDF], abgerufen am 15. Mai 2014)",
"text": "“To find the co-accessible states, reverse the arrows and begin with the acceptance states.”",
"title": "Automata Theory with Modern Applications",
"url": "zitiert nachbib.tiera.ru [PDF]",
"year": "2006"
},
{
"accessdate": "2014-05-15",
"author": "Jacques Sakarovitch",
"isbn": "978-0-521-84425-3",
"pages": "67",
"place": "Cambridge",
"publisher": "Cambridge University Press",
"ref": "Jacques Sakarovitch: Elements of Automata Theory. Cambridge University Press, Cambridge 2009, ISBN 978-0-521-84425-3, Seite 67 (zitiert nach Google Books, abgerufen am 15. Mai 2014)",
"text": "“We will say that a state p is useful if it is both accessible and co-accessible.”",
"title": "Elements of Automata Theory",
"url": "zitiert nachGoogle Books",
"year": "2009"
},
{
"accessdate": "2014-05-15",
"author": "Hugues Chabot, Raphael Khoury, Nadia Tawbi",
"collection": "Identity and Privacy in the Internet Age",
"editor": "Audun Jøsang, Torleiv Maseng, Svein Johan Knapskog",
"isbn": "978-3-642-04765-7",
"pages": "290",
"place": "Berlin/Heidelberg",
"publisher": "Springer",
"ref": "Hugues Chabot, Raphael Khoury, Nadia Tawbi: Generating In-Line Monitors for Rabin Automata. In: Audun Jøsang, Torleiv Maseng, Svein Johan Knapskog (Herausgeber): Identity and Privacy in the Internet Age. Springer, Berlin/Heidelberg 2009, ISBN 978-3-642-04765-7, Seite 290 (zitiert nach Google Books, abgerufen am 15. Mai 2014)",
"text": "“In this figure, all the states are accessible and co-accessible.”",
"title": "Generating In-Line Monitors for Rabin Automata",
"url": "zitiert nachGoogle Books",
"year": "2009"
},
{
"accessdate": "2014-05-15",
"author": "Johannes Bubenzer, Kay-Michael Würzner",
"collection": "Finite-State Methods and Natural Language Processing",
"editor": "Anssi Yli-Jyrä, András Kornai, Jacques Sakarovitch, Bruce Watson",
"isbn": "978-3-642-14683-1",
"pages": "99",
"place": "Berlin/Heidelberg",
"publisher": "Springer",
"ref": "Johannes Bubenzer, Kay-Michael Würzner: Joining Composition and Trimming of Finite-State Transducers. In: Anssi Yli-Jyrä, András Kornai, Jacques Sakarovitch, Bruce Watson (Herausgeber): Finite-State Methods and Natural Language Processing. Springer, Berlin/Heidelberg 2010, ISBN 978-3-642-14683-1, Seite 99 (zitiert nach Google Books, abgerufen am 15. Mai 2014)",
"text": "“The only difference is that it may remain unknown for some state (p₁,p₂) whether it is co-accessible or not even after all its transitions have been processed.”",
"title": "Joining Composition and Trimming of Finite-State Transducers",
"url": "zitiert nachGoogle Books",
"year": "2010"
}
],
"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": "co-accessible"
}
Download raw JSONL data for co-accessible meaning in Englisch (3.5kB)
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.