@article{ITA_1996__30_3_209_0,
author = {Kobayashi, Nami},
title = {The closure under division and a characterization of the recognizable $\mathcal {Z}$-subsets},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
pages = {209--230},
year = {1996},
publisher = {EDP Sciences},
volume = {30},
number = {3},
mrnumber = {1415829},
zbl = {0860.68073},
language = {en},
url = {https://www.numdam.org/item/ITA_1996__30_3_209_0/}
}
TY - JOUR
AU - Kobayashi, Nami
TI - The closure under division and a characterization of the recognizable $\mathcal {Z}$-subsets
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1996
SP - 209
EP - 230
VL - 30
IS - 3
PB - EDP Sciences
UR - https://www.numdam.org/item/ITA_1996__30_3_209_0/
LA - en
ID - ITA_1996__30_3_209_0
ER -
%0 Journal Article
%A Kobayashi, Nami
%T The closure under division and a characterization of the recognizable $\mathcal {Z}$-subsets
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1996
%P 209-230
%V 30
%N 3
%I EDP Sciences
%U https://www.numdam.org/item/ITA_1996__30_3_209_0/
%G en
%F ITA_1996__30_3_209_0
Kobayashi, Nami. The closure under division and a characterization of the recognizable $\mathcal {Z}$-subsets. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 30 (1996) no. 3, pp. 209-230. https://www.numdam.org/item/ITA_1996__30_3_209_0/
1. and , Les Séries Rationnelles et Leurs Langages, Masson, Paris, 1984. | Zbl | MR
2. , Automata, Languages and Machines, vol. A, Academic Press, New York, 1974. | Zbl | MR
3. , A Decision Procedure for the Order of Regular Events, Theoret. Comput. Sci., 1979, 8, pp. 69-72. | Zbl | MR
4. , Limitedness Theorem on Finite Automata with Distance Functions, J. Comput. System Sci., 1982, 24, 2, pp. 233-244. | Zbl | MR
5. , Improved Limitedness Theorem on Finite Automata with Distance Functions, Theoret. Comput. Sci., 1990, 72, pp. 27-38. | Zbl | MR
6. , Algorithms for Determining Relative Star Height and Star Height, Inform. and Comput., 1988, 78, pp. 124-169. | Zbl | MR
7. , Propriedades de M-subconjuntos Reconhecíveis de um Monóide Livre, Tese de Doutorado, Departamento de Ciência da Computação, Instituto de Matemática e Estatística da Universidade de São Paulo, 1991.
8. , Properties of Recognizable M-subsets of a Free Monoid, Lecture Notes in Comput. Sci., 583, I. Simon (Ed.), Springer-Verlag, Proceedings of LATIN'92, 1st Latin American Symposium on Theoretical INformatics, São Paulo, Brazil, 1992, pp. 314-328. | MR
9. , The Closure Under Division and a Characterization of the Recognizable Z-subsets, Technical Report RT-MAC-9415, IME-USP, São Paulo, 1994.
10. The Equality Problem for Rational Series with Multiplicities in the Tropical Semiring is Undecidable, Internat. J. Algebra and Comput., 1994, 4, 3, pp. 405-425. | Zbl | MR
11. , Some Consequences of a Fatou Property of the Tropical Semiring, J. Pure Appl. Algebra, 1994, 93, 3, pp. 231-249. | Zbl | MR
12. , Limitedness Teorem on Finite Automata with Distance Functions: an Algebraic Proof, Theoret. Comput. Sci., 1991, 81, pp. 137-145. | Zbl | MR
13. , Limited Subsets of a Free Monoid, in Proc. 19th. Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, Piscataway, N.J., 1978, pp. 143-150. | MR
14. , The Nondeterministic Complexity of a Finite Automaton, in M. Lothaire(ed.), Mots - mélanges offerts à M. P. Schützenberger, pp. 384-400, Hermès, Paris, 1990. | MR
15. , Factorization Forests of Finite Height, Theoret. Comput. Sci., 1990, 72, pp. 65-94. | Zbl | MR
16. , Recognizable Sets with Multiplicities in the Tropical Semiring, Lecture Notes in Comput. Sci., 1988, 324, Springer-Verlag, pp. 107-120. | Zbl | MR
17. , On Semigroups of Matrices over the Tropical Semiring, RAIRO Inform. Théor. Appl., 1994, 28, pp. 277-294. | Zbl | MR | Numdam | EuDML





