A lower bound on the state complexity of transforming two-way nondeterministic finite automata to unambiguous finite automata

Documenti analoghi

• A hierarchy of reversible finite automata
  di: Radionova, Maria, et al.
  Pubblicazione: (2024)
• From regular expressions to deterministic finite automata: $2^{\frac{n}{2}+\sqrt{n}(\log n)^{Θ(1)}}$ states are necessary and sufficient
  di: Martynova, Olga, et al.
  Pubblicazione: (2025)
• Nondeterministic tree-walking automata are not closed under complementation
  di: Martynova, Olga, et al.
  Pubblicazione: (2024)
• Weakly-unambiguous Parikh automata and their link to holonomic series
  di: Bostan, Alin, et al.
  Pubblicazione: (2025)
• A quadratic upper bound on the reset thresholds of synchronizing automata containing a transitive permutation group
  di: Zhu, Yinfeng
  Pubblicazione: (2024)