Stack cooperation in multistack pushdown automata
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4135414 (Why is no real title available?)
- scientific article; zbMATH DE number 3602699 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 718630 (Why is no real title available?)
- scientific article; zbMATH DE number 745858 (Why is no real title available?)
- A hierarchy of uniquely parsable grammar classes and deterministic acceptors
- Teams in cooperating grammar systems
Cited in
(11)- Fuzzy \(\omega\)-automata
- PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES
- Returning and non-returning parallel communicating finite automata are equivalent
- Some undecidable problems for parallel communicating finite automata systems
- scientific article; zbMATH DE number 125878 (Why is no real title available?)
- Teams of pushdown automata
- Distributed ω-Automata
- Teams of pushdown automata
- PARALLEL COMMUNICATING PUSHDOWN AUTOMATA SYSTEMS
- Storage products and linear control of derivations
- Cooperating Distributed Tree Automata
This page was built for publication: Stack cooperation in multistack pushdown automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1307700)