B. A. Trakhtenbrot and Ya. M. Barzdin, Finite Automata--Behavior and Synthesis, Fundamental Studies in Computer Science 1 (North--Holland, Amsterdam, 1973). Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Learning Languages and Functions by Erasing - Jain, Kinber, Lange, Wiehagen, .. (1997) (Correct)
....not decidable whether or not an IIM M has already converged on a text t for the target language L. With the next definition, we consider a special case where it has to be decidable whether or not an IIM has successfully finished the learning task. Definition 2 (Gold [14] Trakhtenbrot and Barzdin [31]) Let L be an indexed family, let L be a language, and let 2 R 2 0;1 be a hypothesis space. An IIM M CFinTxt infers L iff for every t 2 text(L) there exist j; z 2 IN such that L = L( j ) M (t y ) for all y z, and M (t y ) j for all y z. M CFinTxt infers L iff M CFinTxt ....
B.A. Trakhtenbrot and Ya.M. Barzdin, Finite Automata -- Behavior and Synthesis, Fundamental Studies in Computer Science 1 (North-Holland, Amsterdam, 1973).
Learning Languages and Functions by Erasing - Jain, Kinber, Lange, Wiehagen, .. (Correct)
....not decidable whether or not an IIM M has already converged on a text t for the target language L. With the next definition, we consider a special case where it has to be decidable whether or not an IIM has successfully finished the learning task. Definition 2 (Gold [14] Trakhtenbrot and Barzdin [31]) Let L be an indexed family, let L be a language, and let 2 R 2 0;1 be a hypothesis space. An IIM M CFinTxt infers L iff for every t 2 text(L) there exist j; z 2 IN such that L = L( j ) M (t y ) for all y z, and M (t y ) j for all y z. M CFinTxt infers L iff M CFinTxt ....
B.A. Trakhtenbrot and Ya.M. Barzdin, Finite Automata -- Behavior and Synthesis, Fundamental Studies in Computer Science 1 (North-Holland, Amsterdam, 1973).
Minimal Cover-Automata for Finite Languages - Campeanu, Santean, Yu (1999) (3 citations) Self-citation (Automata) (Correct)
No context found.
B.A. Trakhtenbrot, Ya. M. Barzdin, Finite Automata: Behaviour and Synthesis, Fundamental Studies in Computer Science, Vol.1, North-Holland, Amsterdam, 1973.
Monotonic and Dual Monotonic Language Learning - Steffen Lange Htwk (1992) (4 citations) (Correct)
No context found.
B. A. Trakhtenbrot and Ya. M. Barzdin, Finite Automata--Behavior and Synthesis, Fundamental Studies in Computer Science 1 (North--Holland, Amsterdam, 1973).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC