A Chomsky-Schützenberger Theorem for Weighted Automata with Storage
From MaRDI portal
Publication:2947152
DOI10.1007/978-3-319-23021-4_11zbMATH Open1465.68149OpenAlexW2296465637MaRDI QIDQ2947152FDOQ2947152
Authors: Luisa Herrmann, Heiko Vogler 
Publication date: 22 September 2015
Published in: Algebraic Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-23021-4_11
Recommendations
- Weighted automata with storage
- Approximation of weighted automata with storage
- A unifying Kleene theorem for weighted finite automata
- A Kleene theorem for weighted tree automata
- A Kleene-Schützenberger theorem for weighted timed automata
- A Kleene-Schützenberger Theorem for Weighted Timed Automata
- A Kleene theorem for weighted \(\omega\)-pushdown automata
- Pumping lemmas for weighted automata
- scientific article; zbMATH DE number 7407779
- On the determinization of weighted finite automata
Cited In (10)
- The Chomsky-Schützenberger theorem for quantitative context-free languages
- Approximation of weighted automata with storage
- A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
- Linear weighted tree automata with storage and inverse linear tree homomorphisms
- Weighted symbolic automata with data storage
- Weighted automata with storage
- Rational weighted tree languages with storage
- An Automata Characterisation for Multiple Context-Free Languages
- Principal abstract families of weighted tree languages
- Weighted iterated linear control
This page was built for publication: A Chomsky-Schützenberger Theorem for Weighted Automata with Storage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947152)
