Pages that link to "Item:Q2365762"
From MaRDI portal
The following pages link to Inference of finite automata using homing sequences (Q2365762):
Displaying 18 items.
- Compositional CSP Traces Refinement Checking (Q5178982) (← links)
- A learning-based synthesis approach to decentralized supervisory control of discrete event systems with unknown plants (Q5257774) (← links)
- On the Length of Homing Sequences for Nondeterministic Finite State Machines (Q5327497) (← links)
- A Myhill-Nerode theorem for register automata and symbolic trace languages (Q5918650) (← links)
- Regular model checking revisited (Q6045028) (← links)
- Never-stop context-free learning (Q6045031) (← links)
- Active model learning of stochastic reactive systems (Q6045066) (← links)
- Compositional learning for interleaving parallel automata (Q6091209) (← links)
- Learning and characterizing fully-ordered lattice automata (Q6160917) (← links)
- Fingerprinting and analysis of Bluetooth devices with automata learning (Q6185823) (← links)
- Benchmarking Combinations of Learning and Testing Algorithms for Active Automata Learning (Q6487258) (← links)
- Reverse Engineering Through Automata Learning (Q6488341) (← links)
- A new approach for active automata learning based on apartness (Q6535565) (← links)
- Learning realtime one-counter automata (Q6535566) (← links)
- Active learning of deterministic timed automata with Myhill-Nerode style characterization (Q6535622) (← links)
- \(L^*\)-based learning of Markov decision processes (Q6535974) (← links)
- Timed automata verification and synthesis via finite automata learning (Q6536137) (← links)
- Active learning for sound negotiations (Q6649451) (← links)
