暂无分享,去创建一个
[1] G. Viennot. Heaps of Pieces, I: Basic Definitions and Combinatorial Lemmas , 1989 .
[2] Raffaele Giancarlo,et al. On the Determinization of Weighted Finite Automata , 2000, SIAM J. Comput..
[3] Jean Mairesse,et al. Modeling and analysis of timed Petri nets using heaps of pieces , 1997, 1997 European Control Conference (ECC).
[4] Jean Berstel,et al. Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.
[5] Reinhard Klemm,et al. Economy of Description for Single-Valued Transducers , 1994, Inf. Comput..
[6] Christian Choffrut,et al. Une Caracterisation des Fonctions Sequentielles et des Fonctions Sous-Sequentielles en tant que Relations Rationnelles , 1977, Theor. Comput. Sci..
[7] Andreas Weber. Finite-Valued Distance Automata , 1994, Theor. Comput. Sci..
[8] Helmut Seidl,et al. On the Degree of Ambiguity of Finite Automata , 1991, Theor. Comput. Sci..
[9] Imre Simon,et al. Recognizable Sets with Multiplicities in the Tropical Semiring , 1988, MFCS.
[10] Marcel Paul Schützenberger,et al. On the Definition of a Family of Automata , 1961, Inf. Control..
[11] J. Mairesse,et al. Idempotency: Task resource models and (max, +) automata , 1998 .
[12] Mehryar Mohri,et al. Finite-State Transducers in Language and Speech Processing , 1997, CL.
[13] S. Gaubert. Performance evaluation of (max, +) automata , 1995, IEEE Trans. Autom. Control..
[14] Daniel Krob,et al. A Complete System of Identities for One-Letter Rational Expressions with Multiplicities in the Tropical Semiring , 1994, Theor. Comput. Sci..
[15] Shuji Jimbo,et al. Decidability of The Equivalence Problem for Finitely Ambiguous Finance Automata , 2002, Int. J. Algebra Comput..
[16] Jacques Sakarovitch. A Construction on Finite Automata that has Remained Hidden , 1998, Theor. Comput. Sci..
[17] Jean-Marc Vincent,et al. Dynamics of synchronized parallel systems , 1997 .
[18] Cyril Allauzen,et al. Efficient Algorithms for Testing the Twins Property , 2003, J. Autom. Lang. Comb..
[19] Daniel Krob,et al. The Equality Problem for Rational Series with Multiplicities in the tropical Semiring is Undecidable , 1992, Int. J. Algebra Comput..
[20] Kosaburo Hashiguchi,et al. Algorithms for Determining Relative Star height and Star Height , 1988, IFIP Congress.
[21] Marcel Paul Schützenberger,et al. Sur les Relations Rationnelles Entre Monoides Libres , 1976, Theor. Comput. Sci..
[22] Jean Berstel,et al. Rational series and their languages , 1988, EATCS monographs on theoretical computer science.
[23] Arto Salomaa,et al. Semirings, Automata, Languages , 1985, EATCS Monographs on Theoretical Computer Science.
[24] Jacques Sakarovitch,et al. Squaring transducers: an efficient procedure for deciding functionality and sequentiality , 2000, Theor. Comput. Sci..
[25] Samuel Eilenberg,et al. Automata, languages, and machines. A , 1974, Pure and applied mathematics.
[26] P. Moller. Théorie algébrique des systèmes à évènements discrets , 1988 .