Pages that link to "Item:Q3261701"
From MaRDI portal
The following pages link to On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine (Q3261701):
Displaying 14 items.
- Transition submatrices in regular homing experiments and identification of sequential machines of known class using direct-sum transition matrices (Q580161) (← links)
- Algorithms for media (Q947070) (← links)
- Computational complementarity and shift spaces (Q997483) (← links)
- Transition matrices in the measurement and control of synchronous sequential machines (Q1144377) (← links)
- Physical versus computational complementarity. I (Q1376456) (← links)
- Deterministic automata. Simulation, universality and minimality (Q1377610) (← links)
- Composition sequences for functions over a finite domain. (Q1853744) (← links)
- Synchronizing words for real-time deterministic pushdown automata (extended abstract) (Q2079977) (← links)
- System identification via state characterization (Q2557198) (← links)
- Composition Sequences and Synchronizing Automata (Q2891329) (← links)
- Synchronizing Automata and the Černý Conjecture (Q3540093) (← links)
- Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines (Q5200066) (← links)
- Über die Konstruktion nichtvollständiger automaten (Q5553287) (← links)
- Synchronizing words under \textsf{LTL} constraints (Q6161453) (← links)
