TERMIUM Plus®

The Government of Canada’s terminology and linguistic data bank.

BOOLEAN AUTOMATONS [1 record]

Record 1 2020-10-14

English

Subject field(s)
  • Mathematics
  • Artificial Intelligence
CONT

A Boolean automaton is essentially an NFA [non-deterministic finite automaton] except that the transition function is defined in such a way that the result of applying it to a state and a letter yields not a set (or union) of states as in the NFA case, but a Boolean function of the states.

OBS

Boolean automaton: The plural forms are "Boolean automatons" and "Boolean automata."

Key term(s)
  • Boolean automatons
  • Boolean automata
  • Boolian automaton
  • Boolian automatons
  • Boolian automata

French

Domaine(s)
  • Mathématiques
  • Intelligence artificielle
CONT

Les automates booléens opèrent sur des variables binaires.

Key term(s)
  • automate booléien
  • automate boolien

Spanish

Campo(s) temático(s)
  • Matemáticas
  • Inteligencia artificial
CONT

El primer modelo de una red neuronal fue ideado a principios de los años cuarenta del siglo XX; este tipo de neurona era un autómata booleano, esto significa que sus entradas y su salida tomaban valores binarios.

Save record 1

Copyright notice for the TERMIUM Plus® data bank

© Public Services and Procurement Canada, 2024
TERMIUM Plus®, the Government of Canada's terminology and linguistic data bank
A product of the Translation Bureau

Features

Language Portal of Canada

Access a collection of Canadian resources on all aspects of English and French, including quizzes.

Writing tools

The Language Portal’s writing tools have a new look! Easy to consult, they give you access to a wealth of information that will help you write better in English and French.

Glossaries and vocabularies

Access Translation Bureau glossaries and vocabularies.

Date Modified: