The following pages link to Learning nominal automata (Q5370894):
Displaying 18 items.
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees (Q2051763) (← links)
- A categorical framework for learning generalised tree automata (Q2104477) (← links)
- Learning infinite-word automata with loop-index queries (Q2124472) (← links)
- Learning weighted automata over principal ideal domains (Q2200852) (← links)
- Completeness and incompleteness in nominal Kleene algebra (Q2401017) (← links)
- A (co)algebraic theory of succinct automata (Q2423764) (← links)
- Learning Symbolic Automata (Q3303893) (← links)
- Polynomial-time equivalence testing for deterministic fresh-register automata (Q5005176) (← links)
- (Q5028487) (← links)
- (Q5089311) (← links)
- (Q5875378) (← links)
- Completeness of Nominal PROPs (Q5883754) (← links)
- Fast computations on ordered nominal sets (Q5918532) (← links)
- A Myhill-Nerode theorem for register automata and symbolic trace languages (Q5918650) (← links)
- Compositional automata learning of synchronous systems (Q6535219) (← links)
- A new approach for active automata learning based on apartness (Q6535565) (← links)
- Active learning for sound negotiations (Q6649451) (← links)
- Automata and grammars for data words (Q6666782) (← links)