Ω-automaton
id:
automaton-303-8512193
title:
Ω-automaton
text:
In automata theory, a branch of theoretical computer science, an ω-automaton is a variation of a finite automaton that runs on infinite, rather than finite, strings as input. Since ω-automata do not stop, they have a variety of acceptance conditions rather than simply a set of accepting states. ω-automata are useful for specifying behavior of systems that are not expected to terminate, such as hardware, operating systems and control systems. For such systems, one may want to specify a property s
brand slug:
wiki
category slug:
encyclopedia
description:
Variation of a finite automaton that runs on infinite input
original url:
https://en.wikipedia.org/wiki/%CE%A9-automaton
date created:
date modified:
2024-02-29T11:31:57Z
main entity:
{"identifier":"Q291256","url":"https://www.wikidata.org/entity/Q291256"}
image:
fields total:
13
integrity:
14