Which finitely ambiguous automata recognize finitely sequential functions? (extended abstract)
From MaRDI portal
Publication:2849900
DOI10.1007/978-3-642-40313-2_10zbMATH Open1398.68295OpenAlexW192303416MaRDI QIDQ2849900FDOQ2849900
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
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)
- Unambiguous automata denoting finitely sequential functions
- A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Deciding unambiguity and sequentiality of polynomially ambiguous min-plus automata
- Finitely ambiguous and finitely sequential weighted automata over fields
- Multi-sequential word relations
- Finite sequentiality of finitely ambiguous max-plus tree automata
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
- Pumping lemmas for weighted automata
- Finite sequentiality of unambiguous max-plus tree automata
- Multi-sequential word relations
- Degree of sequentiality of weighted automata
- Sequential?
- Finite ambiguity and finite sequentiality in weighted automata over fields
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)
