有ゆう限げんオートマトン

ゆ

う

げ

ん

オ

ー

ト

マ

ト

ン

Meanings

1

noun

finite automaton

computing

Technical computing term for an abstract machine with a finite number of states, used in automata theory and formal language theory.

possess, have, exist

限limit, restrict, to best of ability

プッシュダウン・オートマトン
A pushdown automaton extends a finite automaton with a stack, allowing it to recognize context-free languages.
チューリングマシン
A Turing machine is a more powerful abstract machine with an infinite tape, capable of recognizing recursively enumerable languages.

Compound of 有限 (finite) and オートマトン (automaton), a direct translation of the English term.