Image-binary automata

DOI10.1142/S012905412442005XMaRDI QIDQ7316809zbMATH OpenFDO

Authors Stefan Kiefer, Cas Widdershoven

Publication date 20 August 2026

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1142/S012905412442005X

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites work

• A superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton
• DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY
• Handbook of weighted automata
• scientific article; zbMATH DE number 3760340 (Why is no real title available?)
• scientific article; zbMATH DE number 41838 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 3422259 (Why is no real title available?)
• scientific article; zbMATH DE number 7650821 (Why is no real title available?)
• Improved upper and lower bounds for Büchi disambiguation
• Introduction to probability
• Matrices de Hankel
• NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
• On finitely ambiguous Büchi automata
• On path equivalence of nondeterministic finite automata
• On the definition of a family of automata
• On the degree of ambiguity of finite automata
• Operations on Unambiguous Finite Automata
• Probabilistic automata
• Realizations by stochastic finite automata
• Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata
• Unambiguity in automata theory
• Weighted automata and regular expressions over valuation monoids

This page was built for publication: Image-binary automata

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