论文信息 - The Limitedness Problem on Distance Automata - 字舞流文

The Limitedness Problem on Distance Automata

Hing Leung | Viktor Podolskiy

[1] Kosaburo Hashiguchi,et al. Regular Languages of Star Height One , 1982, Inf. Control..

[2] Hing Leung. Limitedness Theorem on Finite Automata with Distance Functions: An Algebraic Proof , 1991, Theor. Comput. Sci..

[3] Kosaburo Hashiguchi. New upper bounds to the limitedness of distance automata , 2000, Theor. Comput. Sci..

[4] Hing Leung,et al. On the topological structure of a finitely generated semigroup of matrices , 1988 .

[5] Kosaburo Hashiguchi,et al. Algorithms for Determining Relative Star height and Star Height , 1988, IFIP Congress.

[6] Imre Simon,et al. On Semigroups of Matrices over the Tropical Semiring , 1994, RAIRO Theor. Informatics Appl..

[7] Imre Simon,et al. Recognizable Sets with Multiplicities in the Tropical Semiring , 1988, MFCS.

[8] K. Hashiguchi,et al. Representation Theorems on Regular Languages , 1983, J. Comput. Syst. Sci..

[9] H. Leung. Idempotency: The topological approach to the limitedness problem on distance automata , 1998 .