Automata-Based Programming

Why Trust Techopedia

What Does Automata-Based Programming Mean?

Automata-based programming is a type of programming where any part of the codebase represents a finite state machine or similar automaton.

Advertisements

The automaton will generally have a variety of states, and will only exist in one particular state at a given time.

Techopedia Explains Automata-Based Programming

Automata-based programming utilizes automata theory to build this particular paradigm and model where the state of the automaton is useful in determining outputs. One way to think about this type of program is that programmers may create logical finite state machines within a codebase, and reference them in relation to their states.

Some experts talk about step-based programming that assesses the automaton in particular ways to work with the other parts of the codebase according to an iterative loop or an algorithm.

In general, automata-based programming uses the concept of the automaton in digital logic. Automata-based programming can also be combined with other modern programming approaches such as object-oriented programming.

Advertisements

Related Terms

Margaret Rouse
Technology Specialist
Margaret Rouse
Technology Specialist

Margaret is an award-winning writer and educator known for her ability to explain complex technical topics to a non-technical business audience. Over the past twenty years, her IT definitions have been published by Que in an encyclopedia of technology terms and cited in articles in the New York Times, Time Magazine, USA Today, ZDNet, PC Magazine, and Discovery Magazine. She joined Techopedia in 2011. Margaret’s idea of ​​a fun day is to help IT and business professionals to learn to speak each other’s highly specialized languages.