Which finitely ambiguous automata recognize finitely sequential functions? (extended abstract)

DOI10.1007/978-3-642-40313-2_10MaRDI QIDQ2849900zbMATH OpenOpenAlexFDO

Authors Sebastian Bala

Publication date 20 September 2013

Published in Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40313-2_10

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Unambiguous automata denoting finitely sequential functions
• scientific article; zbMATH DE number 2040921
• Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
• Deciding unambiguity and sequentiality of polynomially ambiguous min-plus automata
• On deterministic weighted automata

Cited in

(15)

• Pumping lemmas for weighted automata
• Finite ambiguity and finite sequentiality in weighted automata over fields
• A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
• Sequential?
• Multi-sequential word relations
• scientific article; zbMATH DE number 2040921 (Why is no real title available?)
• scientific article; zbMATH DE number 7559164 (Why is no real title available?)
• Finite sequentiality of finitely ambiguous max-plus tree automata
• Multi-sequential word relations
• Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
• Unambiguous automata denoting finitely sequential functions
• Finitely ambiguous and finitely sequential weighted automata over fields
• Degree of sequentiality of weighted automata
• Deciding unambiguity and sequentiality of polynomially ambiguous min-plus automata
• Finite sequentiality of unambiguous max-plus tree automata

This page was built for publication: Which finitely ambiguous automata recognize finitely sequential functions? (extended abstract)

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