date: 2024-11-13
title: 07-TOC-PDA
status: DONE
author:
- AllenYGY
tags:
- NOTE
- TOC
- PDA
publish: True
TOC-PDA
To access the infinite memory space, an NFA is upgraded by a stack. A stack has these basic operations.
The computational model combines a finite state machine and a stack is called pushdown automata
A pushdown automaton is a 6-tuple
The transition function
If:
Then:
PDA is defined from NFA.
An input string
The last condition explains a transition.
A PDA for