| dbpprop:abstract
|
- In computer science, one counter automaton is a Pushdown automaton with only two symbols in <math>\Gamma\,</math> (A and the initial symbol) (the finite set of stack symbols), this automaton can be used for accept one subset of Context free languages, example the language: <math> {\ xy \in\ {a, b}{*} : numberofa(x) = numberofb(y)} \} </math> For accept the previous language, the automaton can use the symbol A for count the number of a in x (writing A per each A in x) and deleting one A per each b in y.
|
![[RDF Data]](/statics/sw-cube.png)
