Fundamental results for learning deterministic extended finite state machines from queries
Yes === Regular language inference, initiated by Angluin, has many developments, including applications in software engineering and testing. However, the capability of finite automata to model the system data is quite limited and, in many cases, extended finite state machine formalisms, that combine...
| Main Authors: | , , |
|---|---|
| Language: | en |
| Published: |
2020
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10454/18046 |