scientific article; zbMATH DE number 3478415
From MaRDI portal
Publication:4061986
Cited in
(16)- Parameter-reduction of higher level grammars
- The OI-hierarchy is closed under control
- The IO- and OI-hierarchies
- Iterated stack automata and complexity classes
- IO and OI. I
- IO and OI. II
- Decidability of the finiteness of ranges of tree transductions
- Principal abstract families of weighted tree languages
- Local higher-order fixpoint iteration
- Weighted automata with storage
- Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable
- A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
- scientific article; zbMATH DE number 7455743 (Why is no real title available?)
- Lambda-Definable Order-3 Tree Functions are Well-Quasi-Ordered
- Look-ahead on pushdowns
- Size-preserving translations from order-(n+1) word grammars to order-n tree grammars
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 Q4061986)