scientific article; zbMATH DE number 2016847
From MaRDI portal
Publication:4439451
Recommendations
- Directable nondeterministic automata
- scientific article; zbMATH DE number 2050929
- scientific article; zbMATH DE number 2106356
- scientific article; zbMATH DE number 4185044
- Theory Is Forever
- scientific article; zbMATH DE number 1868895
- scientific article; zbMATH DE number 2213327
- scientific article; zbMATH DE number 809137
- Nondeterminism versus determinism of finite automata over directed acyclic graphs
- Strictifying and taming directed paths in higher dimensional automata
Cited in
(16)- Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
- Directable nondeterministic automata
- Synchronization of automata with one undefined or ambiguous transition
- Necks of automata
- On monogenic nondeterministic automata
- scientific article; zbMATH DE number 4037204 (Why is no real title available?)
- scientific article; zbMATH DE number 2050929 (Why is no real title available?)
- scientific article; zbMATH DE number 1870554 (Why is no real title available?)
- scientific article; zbMATH DE number 1868895 (Why is no real title available?)
- scientific article; zbMATH DE number 2106356 (Why is no real title available?)
- scientific article; zbMATH DE number 809137 (Why is no real title available?)
- scientific article; zbMATH DE number 1408331 (Why is no real title available?)
- scientific article; zbMATH DE number 2213327 (Why is no real title available?)
- scientific article; zbMATH DE number 4185044 (Why is no real title available?)
- Shortest directing words of nondeterministic directable automata
- Improved upper bounds on synchronizing nondeterministic 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 Q4439451)
