Greibach normal form for -algebraic systems and weighted simple -pushdown automata
From MaRDI portal
Publication:2672253
Recommendations
Cites work
- A Kleene theorem for weighted -pushdown automata
- A logical characterization of timed pushdown languages
- A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
- Handbook of weighted automata
- scientific article; zbMATH DE number 5141498 (Why is no real title available?)
- scientific article; zbMATH DE number 3932372 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3238653 (Why is no real title available?)
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- scientific article; zbMATH DE number 7650335 (Why is no real title available?)
- Logic for \(\omega\)-pushdown automata
- Logics for weighted timed pushdown automata
- Matricial theories
- Matrix and matricial iteration theories. II
- On iteration semiring-semimodule pairs.
- The triple-pair construction for weighted \(\omega\)-pushdown automata
- Theory Is Forever
- Theory of -languages. I: Characterizations of -context- free languages
- Weighted simple reset pushdown automata
Cited in
(6)- Weighted simple reset pushdown automata
- Weighted omega-restricted one counter automata
- The triple-pair construction for weighted \(\omega\)-pushdown automata
- scientific article; zbMATH DE number 7650335 (Why is no real title available?)
- The Triple-Pair Construction for Weighted ω-Pushdown Automata
- Weighted Linear Dynamic Logic
This page was built for publication: Greibach normal form for \(\omega\)-algebraic systems and weighted simple \(\omega\)-pushdown automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2672253)