Content deleted Content added
{Bots|deny=AWB}}<!--REASON: incorrectly identifies the first "{" in "{[[empty string{{!}}ε]]}" as an unbalanced bracket & removes it--> thumb|right|A nested stack automaton has the same devices as a [[pushdown automaton, but has less restrictions for using them.]] In automata theory, a '''nested stack automaton''' is a finite automaton that can make use of a stack containing data which can be additional st... Tags: Mobile edit Mobile web edit |
Citation bot (talk | contribs) Misc citation tidying. | Use this bot. Report bugs. | #UCB_CommandLine |
||
Line 113:
When automata are allowed to re-read their input ("[[Two-way automaton|two-way automata]]"), nested stacks do not result in additional language recognition capabilities, compared to plain stacks.<ref>{{cite journal |last1=Beeri |first1=C. |title=Two-way nested stack automata are equivalent to two-way stack automata |journal=Journal of Computer and System Sciences |date=June 1975 |volume=10 |issue=3 |pages=317–339 |doi=10.1016/s0022-0000(75)80004-3 |doi-access=free }}</ref>
Gilman and Shapiro used nested stack automata to solve the [[Word problem for groups|word problem]] in certain [[Group (mathematics)|groups]].<ref>{{cite
==Notes==
| |||
