scientific article; zbMATH DE number 4178795
From MaRDI portal
Publication:3201770
Recommendations
Cited in
(11)- Detecting useless transitions in pushdown automata
- A direct construction of finite state automata for pushdown store languages
- On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs
- On reducing the number of stack symbols in a PDA
- Minimization of visibly pushdown automata using partial Max-SAT
- scientific article; zbMATH DE number 3866587 (Why is no real title available?)
- scientific article; zbMATH DE number 4074488 (Why is no real title available?)
- scientific article; zbMATH DE number 1213009 (Why is no real title available?)
- scientific article; zbMATH DE number 1309169 (Why is no real title available?)
- Detecting useless transitions in pushdown automata
- Solution of the generalized minimization problem for two-tape automata with one fixed tape
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3201770)