메뉴 건너뛰기




Volumn 204, Issue 1-2, 1998, Pages 205-231

A construction on finite automata that has remained hidden

Author keywords

Cross section theorem; Finite automata; Finite transducers; Rational relations; Unambiguous functions

Indexed keywords


EID: 0348228140     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00040-1     Document Type: Article
Times cited : (26)

References (16)
  • 1
    • 0008764965 scopus 로고
    • A new proof of two theorems about rational transductions
    • A. Arnold, M. Latteux, A new proof of two theorems about rational transductions, Theoret. Comput. Sci. 8 (1979) 261-263.
    • (1979) Theoret. Comput. Sci. , vol.8 , pp. 261-263
    • Arnold, A.1    Latteux, M.2
  • 4
    • 0002313940 scopus 로고
    • On relations defined by generalized finite automata
    • C.C. Elgot, J.E. Mezei, On relations defined by generalized finite automata, IBM J. Res. Dev. 9 (1965) 47-68.
    • (1965) IBM J. Res. Dev. , vol.9 , pp. 47-68
    • Elgot, C.C.1    Mezei, J.E.2
  • 5
    • 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
  • 6
    • 38249006551 scopus 로고
    • Synchronized rational relations of finite and infinite words
    • Ch. Frougny, J. Sakarovitch, Synchronized rational 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
  • 9
    • 0014538804 scopus 로고
    • Classification of formal languages by functional binary transductions
    • K. Kobayashi, Classification of formal languages by functional binary transductions, Inform. and Control 15 (1969) 95-109.
    • (1969) Inform. and Control , vol.15 , pp. 95-109
    • Kobayashi, K.1
  • 10
    • 0002689259 scopus 로고
    • Finite Automata
    • J. van Leeuwen (Ed.), Elsevier, Amsterdam
    • D. Perrin, Finite Automata, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Elsevier, Amsterdam, 1990, pp. 1-53.
    • (1990) Handbook of Theoretical Computer Science , pp. 1-53
    • Perrin, D.1
  • 11
  • 12
    • 0012434684 scopus 로고
    • Certain elementary families of automata
    • Polytechnic Institute of Brooklyn
    • M.P. Schützenberger, Certain elementary families of automata, in: Proc. Symp. on Mathematical Theory of Automata, Polytechnic Institute of Brooklyn, 1962, pp. 139-153.
    • (1962) Proc. Symp. on Mathematical Theory of Automata , pp. 139-153
    • Schützenberger, M.P.1
  • 14
    • 49549129490 scopus 로고
    • Sur les relations rationnelles entre monoïdes libres
    • M.P. Schützenberger, Sur les relations rationnelles entre monoïdes libres, Theoret. Comput. Sci. 3 (1976) 243-259.
    • (1976) Theoret. Comput. Sci. , vol.3 , pp. 243-259
    • Schützenberger, M.P.1
  • 15
    • 0000838443 scopus 로고
    • Une variante des fonctions séquentielles
    • M.P. Schützenberger, 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
  • 16
    • 0000980586 scopus 로고
    • Topology of finite graphs
    • J.R. Stallings, Topology of finite graphs, Invent. Math. 71 (1983) 551-565.
    • (1983) Invent. Math. , vol.71 , pp. 551-565
    • Stallings, J.R.1


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