This tool looks for unlabeled Wikidata items in your language. It starts with a Wikidata item,
looks at all the associated Wikipedia pages, the links on all those pages, and lists the Wikidata items corresponding to the link targets.
Q7805517 - Timed automaton
Searching link targets on 4 Wikipedias...
| Item | Label [en] | Wikilabels | Link # |
|---|---|---|---|
Q214526 [CC |  ] | automata theory | Automata theory | Théorie des automates | Теорія автоматів | 3 |
| Q272404 [CC | ] | finite set | Finite set | مجموعه متناهی | Ensemble fini | 3 |
| Q4650732 [CC | ] | ACM Transactions on Computational Logic | ACM Transactions on Computational Logic | 2 |
| Q176452 [CC | ] | finite-state machine | Automate fini | Скінченний автомат | 2 |
| Q65061719 [CC | ] | Alternating timed automaton | Alternating timed automaton | 1 |
| Q65084403 [CC | ] | clock | Clock (model checking) | 1 |
| Q5138050 [CC | ] | coanalytic set | Coanalytic set | 1 |
| Q5157286 [CC | ] | computational complexity | Computational complexity | 1 |
| Q3262192 [CC | ] | decision problem | Decision problem | 1 |
| Q5953179 [CC | ] | Hybrid automaton | Hybrid automaton | 1 |
| Q905967 [CC | ] | PSPACE-complete | PSPACE-complete | 1 |
| Q17141570 [CC | ] | Reachability problem | Reachability problem | 1 |
| Q65064105 [CC | ] | region | Region (model checking) | 1 |
| Q7782354 [CC | ] | Theoretical Computer Science | Theoretical Computer Science (journal) | 1 |
| Q65079196 [CC | ] | Timed word | Timed word | 1 |
| Q7898420 [CC | ] | Uppaal Model Checker | Uppaal Model Checker | 1 |
| Q520777 [CC | ] | boolean data type | نوع داده بولی | 1 |
| Q30748200 [CC | ] | No label in en! | Algorithme de Brzozowski de minimisation d'un automate fini | 1 |
| Q23001663 [CC | ] | No label in en! | Algorithme de Conway | 1 |
| Q30751650 [CC | ] | No label in en! | Algorithme de Hopcroft de minimisation d'un automate fini | 1 |
| Q23001664 [CC | ] | No label in en! | Algorithme de McNaughton et Yamada | 1 |
| Q12637006 [CC | ] | Moore reduction procedure | Algorithme de Moore de minimisation d'un automate fini | 1 |
| Q7795667 [CC | ] | Thompson's construction algorithm | Algorithme de Thompson | 1 |
| Q181593 [CC | ] | sorting algorithm | Algorithme de tri | 1 |
| Q134164 [CC | ] | simplex algorithm | Algorithme du simplexe | 1 |
| Q504353 [CC | ] | greedy algorithm | Algorithme glouton | 1 |
| Q187787 [CC | ] | genetic algorithm | Algorithme génétique | 1 |
| Q583461 [CC | ] | randomized algorithm | Algorithme probabiliste | 1 |
| Q13636890 [CC | ] | algorithmics | Algorithmique | 1 |
| Q184741 [CC | ] | string algorithm | Algorithmique du texte | 1 |
| Q333464 [CC | ] | analysis of algorithms | Analyse de la complexité des algorithmes | 1 |
| Q11216 [CC | ] | numerical analysis | Analyse numérique | 1 |
| Q197536 [CC | ] | deep learning | Apprentissage profond | 1 |
| Q223655 [CC | ] | tree | Arbre enraciné | 1 |
| Q11387554 [CC | ] | proof assistant | Assistant de preuve | 1 |
| Q189156 [CC | ] | cellular automaton | Automate cellulaire | 1 |
| Q2872598 [CC | ] | Tree automaton | Automate d'arbres | 1 |
| Q1020380 [CC | ] | Büchi automaton | Automate de Büchi | 1 |
| Q1436514 [CC | ] | Muller automaton | Automate de Muller | 1 |
| Q3300791 [CC | ] | Alternating finite automaton | Automate fini alternant | 1 |
| Q837528 [CC | ] | deterministic finite automata | Automate fini déterministe | 1 |
| Q243800 [CC | ] | two-way deterministic finite automaton | Automate fini déterministe bidirectionnel | 1 |
| Q1306211 [CC | ] | unambiguous finite automaton | Automate fini inambigu | 1 |
| Q617295 [CC | ] | nondeterministic finite automaton | Automate fini non déterministe | 1 |
| Q1520616 [CC | ] | No label in en! | Automate pondéré | 1 |
| Q176567 [CC | ] | probabilistic automaton | Automate probabiliste | 1 |
| Q176837 [CC | ] | quantum finite automata | Automate quantique | 1 |
| Q291256 [CC | ] | ω-automaton | Automate sur les mots infinis | 1 |
| Q56317010 [CC | ] | No label in en! | Automate séquentiel | 1 |
| Q751443 [CC | ] | pushdown automaton | Automate à pile | 1 |
| Q4055684 [CC | ] | first-order logic | Calcul des prédicats | 1 |
| Q141090 [CC | ] | encryption | Chiffrement | 1 |
| Q2981393 [CC | ] | No label in en! | Codage de l'information | 1 |
| Q76592 [CC | ] | combinatorics | Combinatoire | 1 |
| Q47506 [CC | ] | compiler | Compilateur | 1 |
| Q30595656 [CC | ] | State complexity | Complexité en états | 1 |
| Q2493 [CC | ] | data compression | Compression de données | 1 |
| Q827139 [CC | ] | Glushkov's construction algorithm | Construction de Glushkov | 1 |
| Q2106494 [CC | ] | Powerset construction | Construction par sous-ensembles | 1 |
| Q975734 [CC | ] | Curry–Howard correspondence | Correspondance de Curry-Howard | 1 |
| Q897511 [CC | ] | cryptanalysis | Cryptanalyse | 1 |
| Q8789 [CC | ] | cryptography | Cryptographie | 1 |
| Q25670 [CC | ] | digital object identifier | Digital Object Identifier | 1 |
| Q671298 [CC | ] | divide-and-conquer algorithm | Diviser pour régner (informatique) | 1 |
| Q430001 [CC | ] | decidability | Décidabilité | 1 |
| Q17005656 [CC | ] | Brzozowski derivative | Dérivée de Brzozowski | 1 |
| Q205170 [CC | ] | power set | Ensemble des parties d'un ensemble | 1 |
| Q7295782 [CC | ] | Rational set | Ensemble rationnel | 1 |
| Q877945 [CC | ] | recursive set | Ensemble récursif | 1 |
| Q3060764 [CC | ] | European Association for Theoretical Computer Science | European Association for Theoretical Computer Science | 1 |
| Q172491 [CC | ] | data mining | Exploration de données | 1 |
| Q185612 [CC | ] | regular expression | Expression régulière | 1 |
| Q284164 [CC | ] | μ-recursive function | Fonction récursive | 1 |
| Q1570472 [CC | ] | primitive recursive function | Fonction récursive primitive | 1 |
| Q373045 [CC | ] | formal grammar | Grammaire formelle | 1 |
| Q874709 [CC | ] | computational geometry | Géométrie algorithmique | 1 |
| Q1981968 [CC | ] | heuristic | Heuristique (mathématiques) | 1 |
| Q190913 [CC | ] | Chomsky hierarchy | Hiérarchie de Chomsky | 1 |
| Q2878974 [CC | ] | theoretical computer science | Informatique théorique | 1 |
| Q33057 [CC | ] | International Standard Book Number | International Standard Book Number | 1 |
| Q333341 [CC | ] | Abstract interpretation | Interprétation abstraite | 1 |
| Q242028 [CC | ] | lambda calculus | Lambda-calcul | 1 |
| Q25391821 [CC | ] | No label in en! | Langage congruentiel | 1 |
| Q192161 [CC | ] | formal language | Langage formel | 1 |
| Q6664444 [CC | ] | local language | Langage local | 1 |
| Q752532 [CC | ] | regular language | Langage rationnel | 1 |
| Q3217203 [CC | ] | Star-free language | Langage sans étoile | 1 |
| Q670618 [CC | ] | Arden's rule | Lemme d'Arden | 1 |
| Q2292874 [CC | ] | Pumping lemma for regular languages | Lemme de l'étoile | 1 |
| Q182557 [CC | ] | computational linguistics | Linguistique informatique | 1 |
| Q3245720 [CC | ] | No label in en! | Liste des algorithmes de la théorie des graphes | 1 |
| Q1166618 [CC | ] | mathematical logic | Logique mathématique | 1 |
| Q787114 [CC | ] | abstract machine | Machine abstraite | 1 |
| Q1126309 [CC | ] | Mealy machine | Machine de Mealy | 1 |
| Q640119 [CC | ] | Moore machine | Machine de Moore | 1 |
| Q163310 [CC | ] | Turing machine | Machine de Turing | 1 |
| Q333385 [CC | ] | abstract state machine | Machine à états abstraits | 1 |
| Q121416 [CC | ] | discrete mathematics | Mathématiques discrètes | 1 |
| Q5204896 [CC | ] | DFA minimization | Minimisation d'un automate fini déterministe | 1 |
| Q176769 [CC | ] | hidden Markov model | Modèle de Markov caché | 1 |
| Q3321297 [CC | ] | syntactic monoid | Monoïde syntaxique | 1 |
| Q3325036 [CC | ] | No label in en! | Mot infini | 1 |
| Q25390038 [CC | ] | No label in en! | Méthode de Brzozowski et McCluskey | 1 |
| Q1049183 [CC | ] | formal methods | Méthode formelle (informatique) | 1 |
| Q1333872 [CC | ] | combinatorial optimization | Optimisation combinatoire | 1 |
| Q500716 [CC | ] | PSPACE | PSPACE | 1 |
| Q232661 [CC | ] | parallel computing | Parallélisme (informatique) | 1 |
| Q4353569 [CC | ] | Church–Turing–Deutsch principle | Principe de Church-Turing-Deutsch | 1 |
| Q622849 [CC | ] | halting problem | Problème de l'arrêt | 1 |
| Q128392 [CC | ] | concurrent computing | Programmation concurrente | 1 |
| Q380679 [CC | ] | dynamic programming | Programmation dynamique | 1 |
| Q194292 [CC | ] | operations research | Recherche opérationnelle | 1 |
| Q676835 [CC | ] | recursively enumerable set | Récursivement énumérable | 1 |
| Q2103034 [CC | ] | polynomial-time reduction | Réduction polynomiale | 1 |
| Q192776 [CC | ] | artificial neural network | Réseau de neurones artificiels | 1 |
| Q1668499 [CC | ] | rewriting | Réécriture (informatique) | 1 |
| Q2374463 [CC | ] | data science | Science des données | 1 |
| Q1077740 [CC | ] | Kripke structure | Structure de Kripke | 1 |
| Q175263 [CC | ] | data structure | Structure de données | 1 |
| Q176468 [CC | ] | state transition system | Système de transition d'états | 1 |
| Q792533 [CC | ] | axiomatic semantics | Sémantique axiomatique | 1 |
| Q1437428 [CC | ] | programming language semantics | Sémantique des langages de programmation | 1 |
| Q1189746 [CC | ] | denotational semantics | Sémantique dénotationnelle | 1 |
| Q1930895 [CC | ] | operational semantics | Sémantique opérationnelle | 1 |
| Q3511599 [CC | ] | Safety (Distributed Computing) | Sûreté (propriété de programme) | 1 |
| Q829546 [CC | ] | primality test | Test de primalité | 1 |
| Q309157 [CC | ] | Church-Turing thesis | Thèse de Church | 1 |
| Q131222 [CC | ] | information theory | Théorie de l'information | 1 |
| Q818930 [CC | ] | computability theory | Théorie de la calculabilité | 1 |
| Q205084 [CC | ] | computational complexity theory | Théorie de la complexité (informatique théorique) | 1 |
| Q177571 [CC | ] | decision theory | Théorie de la décision | 1 |
| Q131476 [CC | ] | graph theory | Théorie des graphes | 1 |
| Q1056428 [CC | ] | type theory | Théorie des types | 1 |
| Q955054 [CC | ] | Kleene's theorem | Théorème de Kleene | 1 |
| Q422187 [CC | ] | Myhill–Nerode theorem | Théorème de Myhill-Nerode | 1 |
| Q3527254 [CC | ] | No label in en! | Théorème des variétés d'Eilenberg | 1 |
| Q200787 [CC | ] | Gödel's incompleteness theorems | Théorèmes d'incomplétude de Gödel | 1 |
| Q2166395 [CC | ] | finite state transducer | Transducteur fini | 1 |
| Q3561421 [CC | ] | Liveness | Vivacité (informatique) | 1 |
| Q1569697 [CC | ] | model checking | Vérification de modèles | 1 |
| Q1676134 [CC | ] | Nerode's congruence | Équivalence de Nerode | 1 |
| Q849775 [CC | ] | Kleene star | Étoile de Kleene | 1 |
| Q3988 [CC | ] | real-time computing | Система реального часу | 1 |