메뉴 건너뛰기




Volumn 191, Issue 1-2, 1998, Pages 61-77

Synchronisation déterministe des automates à délai borné

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0011996460     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00305-2     Document Type: Article
Times cited : (10)

References (15)
  • 1
    • 84937078021 scopus 로고
    • Signed-digit number representations for fast parallel arithmetic
    • A. Avizienis, Signed-digit number representations for fast parallel arithmetic, IRE Trans. Electronic Comput. 10 (1961) 389-400.
    • (1961) IRE Trans. Electronic Comput. , vol.10 , pp. 389-400
    • Avizienis, A.1
  • 4
    • 0000262264 scopus 로고
    • A combinatorial problem
    • N.G. de Bruijn, A combinatorial problem, in: Proc. Nederl. Akad. Wetensch. 49 (1946) 758-764. Indag. Math. 8 (1946) 461-467.
    • (1946) Proc. Nederl. Akad. Wetensch. , vol.49 , pp. 758-764
    • De Bruijn, N.G.1
  • 5
    • 0000527896 scopus 로고
    • N.G. de Bruijn, A combinatorial problem, in: Proc. Nederl. Akad. Wetensch. 49 (1946) 758-764. Indag. Math. 8 (1946) 461-467.
    • (1946) Indag. Math. , vol.8 , pp. 461-467
  • 7
    • 0002313940 scopus 로고
    • On relations defined by generalized finite automata
    • C.C. Elgot and J.E. Mezei, On relations defined by generalized finite automata, IBM J. Res. Develop. 9 (1965) 47-68.
    • (1965) IBM J. Res. Develop. , vol.9 , pp. 47-68
    • Elgot, C.C.1    Mezei, J.E.2
  • 8
    • 0026124303 scopus 로고
    • Fibonacci representations and finite automata
    • Ch. Frougny, Fibonacci representations and finite automata, IEEE. Trans. Inform. Theory 37 (1991) 393-399.
    • (1991) IEEE. Trans. Inform. Theory , vol.37 , pp. 393-399
    • Frougny, Ch.1
  • 9
    • 0002389262 scopus 로고
    • Representation of numbers and finite automata
    • Ch. Frougny, Representation of numbers and finite automata, Math. Systems Theory 25 (1992) 37-60.
    • (1992) Math. Systems Theory , vol.25 , pp. 37-60
    • Frougny, Ch.1
  • 10
    • 38249006551 scopus 로고
    • Synchronized relations of finite and infinite words
    • Ch. Frougny and J. Sakarovitch, Synchronized relations of finite and infinite words, Theoret. Comput. Sci. 108 (1993) 45-82.
    • (1993) Theoret. Comput. Sci. , vol.108 , pp. 45-82
    • Frougny, Ch.1    Sakarovitch, J.2
  • 12
    • 0028449221 scopus 로고
    • Some characterizations of functions computable in on-line arithmetic
    • J.-M. Muller, Some characterizations of functions computable in on-line arithmetic, IEEE Trans. Comput. 43 (1994) 752-755.
    • (1994) IEEE Trans. Comput. , vol.43 , pp. 752-755
    • Muller, J.-M.1
  • 13
    • 0030570638 scopus 로고    scopus 로고
    • On the linearity of on-line computable functions
    • à paraître
    • H. Pélibossian, On the linearity of on-line computable functions, Theoret. Comput. Sci., à paraître.
    • Theoret. Comput. Sci.
    • Pélibossian, H.1
  • 14
    • 0000838443 scopus 로고
    • Sur une variante des fonctions séquentielles
    • M.P. Schützenberger, Sur une variante des fonctions séquentielles, Theoret. Comput. Sci. 4 (1977) 47-57.
    • (1977) Theoret. Comput. Sci. , vol.4 , pp. 47-57
    • Schützenberger, M.P.1
  • 15
    • 0017516220 scopus 로고
    • On line algorithms for division and multiplication
    • K.S. Trivedi and M.D. Ercegovac, On line algorithms for division and multiplication, IEEE Trans. Comput. C 26 (1977) 681-687.
    • (1977) IEEE Trans. Comput. C , vol.26 , pp. 681-687
    • Trivedi, K.S.1    Ercegovac, M.D.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.