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