Approximation of weighted automata with storage

MaRDI QIDQ3384165zbMATH OpenFDO

Authors Tobias Denkinger

Publication date 14 December 2021

Full work available at URL https://arxiv.org/abs/1703.09910, http://eptcs.web.cse.unsw.edu.au/paper.cgi?GANDALF2017.7

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Weighted automata with storage
• Rigorous approximated determinization of weighted automata
• An approximate determinization algorithm for weighted finite-state automata
• Non-deterministic weighted automata evaluated over Markov chains
• A Chomsky-Schützenberger Theorem for Weighted Automata with Storage

Cites work

• A Chomsky-Schützenberger Theorem for Weighted Automata with Storage
• A weighted MSO logic with storage behaviour and its Büchi-Elgot-Trakhtenbrot theorem
• An Automata Characterisation for Multiple Context-Free Languages
• Extending lookahead for LR parsers
• scientific article; zbMATH DE number 3646311 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3351454 (Why is no real title available?)
• On multiple context-free grammars
• Practical arbitrary lookahead LR parsing
• Proof of correctness of data representations
• Pushdown machines for the macro tree transducer
• Regular approximation of CFLs: A grammatical view
• Semirings and Formal Power Series
• Some definitional suggestions for automata theory
• TRANSDUCERS AND GRAMMARS AS THEORIES OF LANGUAGE
• Weighted symbolic automata with data storage

Cited in

(1)

• A Chomsky-Schützenberger Theorem for Weighted Automata with Storage

This page was built for publication: Approximation of weighted automata with storage

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3384165)