论文信息 - Efficient Learning of Real Time Two-Counter Automata (Extended Abstract) - 字舞流文

Efficient Learning of Real Time Two-Counter Automata (Extended Abstract)

Amr F. Fahmy | Robert S. Roos | A. Fahmy | R. Roos

[1] Piotr Berman,et al. Deciding equivalence of deterministic one-counter automata in polynomial time with applications to learning , 1988 .

[2] Alan W. Biermann,et al. Synthesis of real-time programs , 1988 .

[3] Piotr Berman,et al. Learning one-counter languages in polynomial time , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[4] J. Hartmanis,et al. Algebraic Structure Theory Of Sequential Machines , 1966 .

[5] Alan W. Biermann,et al. Synthesis of Real Time Acceptors , 1993, J. Symb. Comput..

[6] Dana Angluin,et al. Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..