Image-binary automata

DOI10.1007/978-3-030-93489-7_15OpenAlexW4205369661MaRDI QIDQ2096597

Cas Widdershoven, Stefan Kiefer

Publication date: 9 November 2022

Full work available at URL: https://arxiv.org/abs/2109.01049

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Handbook of weighted automata
• On the degree of ambiguity of finite automata
• Matrices de Hankel
• On path equivalence of nondeterministic finite automata
• On finitely ambiguous Büchi automata
• Realizations by stochastic finite automata
• On complementing unambiguous automata and graphs with many cliques and cocliques
• Finite-Valued Weighted Automata.
• What’s Decidable about Weighted Automata?
• WEIGHTED AUTOMATA AND REGULAR EXPRESSIONS OVER VALUATION MONOIDS
• On the definition of a family of automata
• Markov Chains and Unambiguous Büchi Automata
• Operations on Unambiguous Finite Automata
• A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton
• Improved Upper and Lower Bounds for Büchi Disambiguation
• Unambiguity in Automata Theory
• Probabilistic automata
• NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
• DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY

This page was built for publication: Image-binary automata