scientific article; zbMATH DE number 7720791
From MaRDI portal
Publication:6165570
Recommendations
Cites work
- \(\alpha\)-grammar and quasi-deterministic pushdown automata (QDPDA) of order ``\(n\)
- Algebraic systems and pushdown automata
- Construction of \(\alpha\)-language from the language of a QDPDA of order ``\(n\)
- Equivalence of SDVFA of order \((s,t)\) with DFA, VDFA, NFA and \(\epsilon \)-NFA.
- scientific article; zbMATH DE number 3902039 (Why is no real title available?)
- scientific article; zbMATH DE number 3932372 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 6475964 (Why is no real title available?)
- scientific article; zbMATH DE number 7720787 (Why is no real title available?)
- Optimization of LR(k) parsers
- Semi-deterministic pushdown automata (SDPDA) of order ``\(n\) and \(\beta\)-languages
- Semi-deterministic virtual finite automaton (SDVFA) of order (s,t)
Cited in
(9)- Semi-deterministic pushdown automata (SDPDA) of order ``\(n\) and \(\beta\)-languages
- scientific article; zbMATH DE number 4009840 (Why is no real title available?)
- scientific article; zbMATH DE number 4067251 (Why is no real title available?)
- Some properties on left-(n,2)-languages
- scientific article; zbMATH DE number 7720787 (Why is no real title available?)
- Semi-binary operations on \(\beta\)-languages
- Hyper \(\beta\)-languages of order \(n\)
- Construction of hyper -language from hyper semi-deterministic pushdown automata (HSDPDA) of order n
- Hyper semi-deterministic pushdown automata (HSDPDA) of order ``\(n\)
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 Q6165570)