Counter automaton
id:
counter-automaton-311-9261138
title:
Counter automaton
text:
In computer science, more particular in the theory of formal languages, a counter automaton, or counter machine, is a pushdown automaton with only two symbols, A and the initial symbol in Γ , the finite set of stack symbols. Equivalently, a counter automaton is a nondeterministic finite automaton with an additional memory cell that can hold one nonnegative integer number, which can be incremented, decremented, and tested for being zero.
brand slug:
wiki
category slug:
encyclopedia
description:
Abstract machine used in a formal logic and theoretical computer science
original url:
https://en.wikipedia.org/wiki/Counter_automaton
date created:
date modified:
2024-01-08T08:37:49Z
main entity:
{"identifier":"Q16929819","url":"https://www.wikidata.org/entity/Q16929819"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/7/71/Pushdown-overview.svg","width":363,"height":187}
fields total:
13
integrity:
15