Abstract
The state-sequence reconstruction problem of nonlinear probabilistic automata is considered and solved by a Bayesian optimisation procedure. The resulting state reconstructor is a growing state automaton which, in many cases, can be reduced to an equivalent finite automaton. An example illustrates the results.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
