SCOPUS 정보 검색 플랫폼

Volumn 174, Issue 1-2, 1997, Pages 269-274

The undecidability of some equivalence problems concerning ngsm's and finite substitutions

Author keywords

[No Author keywords available]

Indexed keywords

FINITE AUTOMATA; MINIMIZATION OF SWITCHING NETS; PROBLEM SOLVING; SEQUENTIAL MACHINES; SET THEORY;

FINITE SUBSTITUTIONS; FREE MORPHISMS; LINEAR GRAMMARS; STATE MINIMIZATION;

EQUIVALENCE CLASSES;

EID: 0031102170 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/S0304-3975(96)00246-0 Document Type: Article

Times cited : (6)

References (11)

1
- 0346964548
- The unsolvability of the equivalence problem for Λ-free nondeterministic generalized machines
- T.V. Griffiths, The unsolvability of the equivalence problem for Λ-free nondeterministic generalized machines, J. Assoc. Comput. Mach. 15 (1968) 409-413.
- (1968) J. Assoc. Comput. Mach. , vol.15 , pp. 409-413
- Griffiths, T.V.¹

2
- 0041126762
- Cardinality problems of compositions of morphisms and inverse morphisms
- T. Harju and H.C.M. Kleijn, Cardinality problems of compositions of morphisms and inverse morphisms, Math. Systems Theory 22 (1989) 151-159.
- (1989) Math. Systems Theory , vol.22 , pp. 151-159
- Harju, T.¹ Kleijn, H.C.M.²

3
- 0004392841
- The unsolvability of the equivalence problem for ε-free NGSM's with unary input (output) alphabet and applications
- O.H. Ibarra, The unsolvability of the equivalence problem for ε-free NGSM's with unary input (output) alphabet and applications, SIAM J. Comput. 7 (1978) 524-532.
- (1978) SIAM J. Comput. , vol.7 , pp. 524-532
- Ibarra, O.H.¹

4
- 38249007476
- Equations over finite sets of words and equivalence problems in automata theory
- J. Karhumäki, Equations over finite sets of words and equivalence problems in automata theory, Theoret. Comput. Sci. 108 (1993) 103-118.
- (1993) Theoret. Comput. Sci. , vol.108 , pp. 103-118
- Karhumäki, J.¹

5
- 0346964546
- On the equivalence of compositions of morphisms and inverse morphisms on regular languages
- J. Karhumäki and H.C.M. Kleijn, On the equivalence of compositions of morphisms and inverse morphisms on regular languages, RAIRO Theoret. Inform. 19 (1985) 203-211.
- (1985) RAIRO Theoret. Inform. , vol.19 , pp. 203-211
- Karhumäki, J.¹ Kleijn, H.C.M.²

6
- 0022777021
- On the equivalence of some transductions involving letter to letter morphisms on regular languages
- Y. Maon, On the equivalence of some transductions involving letter to letter morphisms on regular languages, Acta Inform. 23 (1986) 585-596.
- (1986) Acta Inform. , vol.23 , pp. 585-596
- Maon, Y.¹

7
- 0003779905
- Academic Press, New York
- G. Rozenberg and A. Salomaa, The Mathematical Theory of L Systems (Academic Press, New York, 1980).
- (1980) The Mathematical Theory of L Systems
- Rozenberg, G.¹ Salomaa, A.²

8
- 0004253838
- Prentice-Hall, Cambridge
- G. Rozenberg and A. Salomaa, Cornerstones of Undecidability (Prentice-Hall, Cambridge, 1994).
- (1994) Cornerstones of Undecidability
- Rozenberg, G.¹ Salomaa, A.²

9
- 0003990888
- Academic Press, New York
- A. Salomaa, Formal Languages (Academic Press, New York, 1973).
- (1973) Formal Languages
- Salomaa, A.¹

10
- 0346334682
- A machine-oriented approach to compositions of morphisms and inverse morphisms
- P. Turakainen, A machine-oriented approach to compositions of morphisms and inverse morphisms, Bull. EATCS 20 (1983) 162-166.
- (1983) Bull. EATCS , vol.20 , pp. 162-166
- Turakainen, P.¹

11
- 0040048082
- On some transducer equivalence problems for families of languages
- P. Turakainen, On some transducer equivalence problems for families of languages, Internat. J. Computer Math. 23 (1988) 99-124.
- (1988) Internat. J. Computer Math. , vol.23 , pp. 99-124
- Turakainen, P.¹

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