SCOPUS 정보 검색 플랫폼

Volumn 35, Issue 6, 2001, Pages 535-550

On conjugacy of languages

Author keywords

Conjugacy equation; Conway's problem; Languages

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; FINITE AUTOMATA; SET THEORY; THEOREM PROVING;

BIPREFIX CODE; CONJUGACY EQUATION; CONWAYS PROBLEM; SATISFIABILITY PROBLEM;

FORMAL LANGUAGES;

EID: 14244273739 PISSN: 09883754 EISSN: 28047346 Source Type: Journal
DOI: 10.1051/ita:2001130 Document Type: Article

Times cited : (7)

References (15)

1
- 0000767970
- edited by G. Rozenberg and A. Salomaa. Springer
- (1997) Combinatorics of Words, in Handbook of Formal Languages , vol.1 , pp. 329-438
- Choffrut, Ch.¹ Karhumäki, J.²

2
- 0037186220
- The commutation of finite sets: A challenging problem
- (2002) Theoret. Comput. Sci. , vol.273 , pp. 69-79
- Choffrut, Ch.¹ Karhumäki, J.² Ollinger, N.³

7
- 2442622138
- Combinatorial and computational problems of finite sets of words
- (2001) Proc. of MCU'01, Springer, Lecture Notes in Comput. Sci. , vol.2055 , pp. 69-81
- Karhumäki, J.¹

8
- 84974603744
- On the centralizer of a finite set
- (2000) Proc. of ICALP'00, Springer, Lecture Notes in Comput. Sci. , vol.1853 , pp. 536-546
- Karhumäki, J.¹ Petre, I.²

12
- 0000240765
- The problem of solvability of equations in a free semigroup
- (English transl. in Math USSR Sb. 32 (1979) 129-198)
- (1977) Mat. Sb. , vol.103 , pp. 147-236
- Makanin, G.S.¹

13
- 49649141918
- Codes conjugués
- (1972) Inform. and Control , vol.20 , pp. 222-231
- Perrin, D.¹

14
- 0033326404
- Satisfiability of word equations with constants is in PSPACE
- (1999) Proc. of FOCS'99, IEEE , pp. 495-500
- Plandowski, W.¹

15
- 0001479067
- Codes et motifs
- (1989) RAIRO: Theoret. Informatics Appl. , vol.23 , pp. 425-444
- Ratoandramanana, B.¹

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