메뉴 건너뛰기




Volumn 29, Issue 3, 1996, Pages 191-226

Two-way automata and length-preserving homomorphisms

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; EQUIVALENCE CLASSES; FINITE AUTOMATA;

EID: 0010123669     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/BF01201276     Document Type: Article
Times cited : (3)

References (11)
  • 3
    • 0024607552 scopus 로고
    • Concatenation of inputs in a two-way automaton
    • [B1]
    • [B1] J.-C. Birget, Concatenation of inputs in a two-way automaton. Theoretical Computer Science 63 (1989), 141-156.
    • (1989) Theoretical Computer Science , vol.63 , pp. 141-156
    • Birget, J.-C.1
  • 4
    • 85023053899 scopus 로고
    • Basic techniques for two-way finite automata
    • [B2] J. E. Pin (ed.), Lecture Notes in Computer Science, Springer-Verlag, Berlin
    • [B2] J.-C. Birget, Basic techniques for two-way finite automata, in: J. E. Pin (ed.), Formal Properties of Finite Automata and Applications, Lecture Notes in Computer Science, Vol. 386, Springer-Verlag, Berlin, 1989, pp. 56-64.
    • (1989) Formal Properties of Finite Automata and Applications , vol.386 , pp. 56-64
    • Birget, J.-C.1
  • 5
    • 0026940235 scopus 로고
    • Positional simulation of two-way automata: Proof of a conjecture of R. Kannan, and generalizations
    • [B3] special issue on STOC 89
    • [B3] J.-C. Birget, Positional simulation of two-way automata: proof of a conjecture of R. Kannan, and generalizations, Journal of Computer and System Sciences 45 (1992), 154-179 (special issue on STOC 89).
    • (1992) Journal of Computer and System Sciences , vol.45 , pp. 154-179
    • Birget, J.-C.1
  • 6
    • 0001125770 scopus 로고
    • State-complexity of finite-state devices, state-compressibility and incompressibility
    • [B4]
    • [B4] J.-C. Birget, State-complexity of finite-state devices, state-compressibility and incompressibility, Mathematical Systems Theory 26 (1993), 237-269.
    • (1993) Mathematical Systems Theory , vol.26 , pp. 237-269
    • Birget, J.-C.1
  • 7
    • 0027685116 scopus 로고
    • Partial orders on words, minimal elements in regular languages, and state complexity
    • [B5]
    • [B5] J.-C. Birget, Partial orders on words, minimal elements in regular languages, and state complexity, Theoretical Computer Science, 119 (1993), 267-291.
    • (1993) Theoretical Computer Science , vol.119 , pp. 267-291
    • Birget, J.-C.1


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