Publication year
2022Author(s)
Publisher
Cham : Springer Nature Switzerland
ISBN
9783031156298
In
Jansen, N.; Stoelinga, M.; Bos, P. van den (ed.), A Journey from Process Algebra via Timed Automata to Model Learning : Essays Dedicated to Frits Vaandrager on the Occasion of His 60th Birthday, pp. 575-580Publication type
Part of book or chapter of book
Display more detailsDisplay less details
Editor(s)
Jansen, N.
Stoelinga, M.
Bos, P. van den
Organization
Software Science
Book title
Jansen, N.; Stoelinga, M.; Bos, P. van den (ed.), A Journey from Process Algebra via Timed Automata to Model Learning : Essays Dedicated to Frits Vaandrager on the Occasion of His 60th Birthday
Page start
p. 575
Page end
p. 580
Subject
Software ScienceAbstract
It is a natural question to find a DFA or NFA for which a given set of words should be accepted and another given set should not be accepted. In this short note we investigate how to find a smallest automaton for both types by means of SMT solving, and compare the results.
This item appears in the following Collection(s)
- Academic publications [246860]
- Faculty of Science [38055]
Upload full text
Use your RU credentials (u/z-number and password) to log in with SURFconext to upload a file for processing by the repository team.