Content deleted Content added
Recat(s) |
76.17.87.135 (talk) No edit summary |
||
Line 1: | Line 1: | ||
{{orphan|date=November 2008}} |
{{orphan|date=November 2008}} |
||
{{unreferenced|date=November 2008}} |
{{unreferenced|date=November 2008}} |
||
In [[computer science]], one |
In [[computer science]], one ♠ 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> |
<math> {\ xy \in\ {a, b}{*} : numberofa(x) = numberofb(y)} \} </math> |
||
Line 7: | Line 7: | ||
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. |
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. |
||
Accepted languages of counter automaton are regular languages and some context-free languages. |
|||
[[Category:Automata]] |
[[Category:Automata]] |
||
[[Category:Computational models]] |
[[Category:Computational models]] |
Revision as of 07:44, 30 April 2009
In computer science, one ♠ is a Pushdown automaton with only two symbols in (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:
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.
Accepted languages of counter automaton are regular languages and some context-free languages.