scientific article; zbMATH DE number 6004956
From MaRDI portal
Publication:3115697
zbMATH Open1249.68103MaRDI QIDQ3115697FDOQ3115697
Publication date: 10 February 2012
Title of this publication is not available (Why is that?)
Cited In (9)
- Extremal Binary PFAs with Small Number of States
- Title not available (Why is that?)
- Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
- Improved upper bounds on synchronizing nondeterministic automata
- Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata
- Synchronizing Automata of Bounded Rank
- Careful synchronization of partial deterministic finite automata
- Synchronization of Automata with One Undefined or Ambiguous Transition
- Lower Bounds for Synchronizing Word Lengths in Partial Automata
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115697)
