Unambiguous automata denoting finitely sequential functions

DOI10.1007/978-3-642-37064-9_11MaRDI QIDQ4910449zbMATH OpenOpenAlexFDO

Authors Sebastian Bala, Artur Koniński

Publication date 18 March 2013

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-37064-9_11

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Which finitely ambiguous automata recognize finitely sequential functions? (extended abstract)
• Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
• scientific article; zbMATH DE number 2040921
• Deciding unambiguity and sequentiality of polynomially ambiguous min-plus automata
• scientific article; zbMATH DE number 7559164

Cited in

(11)

• Finite sequentiality of unambiguous max-plus tree automata
• Which finitely ambiguous automata recognize finitely sequential functions? (extended abstract)
• Multi-sequential word relations
• Multi-sequential word relations
• scientific article; zbMATH DE number 7559164 (Why is no real title available?)
• scientific article; zbMATH DE number 7204387 (Why is no real title available?)
• A pattern logic for automata with outputs
• Finite sequentiality of finitely ambiguous max-plus tree automata
• Finite sequentiality of finitely ambiguous max-plus tree automata
• Unambiguous automata
• Unary finite automata vs. arithmetic progressions

This page was built for publication: Unambiguous automata denoting finitely sequential functions

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