SCOPUS 정보 검색 플랫폼

Volumn 281, Issue 1-2, 2002, Pages 555-608

L(A) = L(B)? A simplified decidability proof

Author keywords

Complete formal systems; Deterministic pushdown automata; Finite dimensional vector spaces; Matrix semi groups; Rational languages

Indexed keywords

AUTOMATA THEORY; DECISION THEORY; EQUIVALENCE CLASSES; FORMAL LANGUAGES; PROBLEM SOLVING; THEOREM PROVING; VECTORS;

DETERMINISTIC AUTOMATA;

COMPUTABILITY AND DECIDABILITY;

EID: 0037014258 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/S0304-3975(02)00027-0 Document Type: Article

Times cited : (26)

References (14)

1
- 0001529110
- An axiomatic approach to the Korenjac-Hopcroft algorithms
- (1983) Math. Systems Theory , pp. 191-231
- Courcelle, B.¹

3
- 0000126984
- On equivalence of grammars through transformation trees
- (1979) Theoret. Comput. Sci. , vol.9 , pp. 173-205
- Harrison, M.A.¹ Havel, I.M.² Yehudai, A.³

4
- 0001913455
- The equivalence problem for real-time strict deterministic pushdown automata
- in Russian, English translation in Cybern. Systems Anal.
- (1989) Kibernetika , vol.5 , pp. 14-25
- Meitus, Y.V.¹

5
- 0001857605
- Decidability of the equivalence problem for deterministic pushdown automata
- in Russian, English translation in Cybern. Systems Anal.
- (1992) Kibernetika , vol.5 , pp. 20-45
- Meitus, Y.V.¹

6
- 4243626282
- The equivalence problem for real-time d.p.d.a's
- (1987) J. Assoc. Comput. Mach. , vol.34 , pp. 731-760
- Oyamaguchi, M.¹

7
- 0002818197
- Equivalence problem for real-time deterministic pushdown automata
- (1985) Kibernetika , vol.2 , pp. 13-23
- Romanovskii, V.Yu.¹

8
- 84951060219
- The equivalence problem for deterministic pushdown automata is decidable
- Proc. ICALP 97, Springer, Berlin
- (1997) Lecture Notes in Computer Science , vol.1256 , pp. 671-681
- Sénizergues, G.¹

9
- 0032308231
- Decidability of bisimulation equivalence for equational graphs of finite out-degree
- R. Motwani (Ed.), IEEE Computer Society Press, Silver Spring, MD
- (1998) Proc. FOCS'98 , pp. 120-129
- Sénizergues, G.¹

10
- 84887505844
- T(A) = T(B)? in: Proc. ICALP 99, Springer, Berlin, Full proofs in Technical Report 1209-99 of LaBRI, T(A) = T(B)? pp. 1-61
- (1999) Lecture Notes in Computer Science , vol.1644 , pp. 665-675
- Sénizergues, G.¹

11
- 0034905530
- L(A) = L(B)? decidability results from complete formal systems
- (2001) Theoret. Comput. Sci. , vol.251 , pp. 1-166
- Sénizergues, G.¹

12
- 0004234808
- Technical Report, Edinburgh ECS-LFCS-99-411
- (1999) Decidability of dpda's equivalence , pp. 1-25
- Stirling, C.¹

13
- 0034910953
- Decidability of dpda's equivalence
- (2001) Theoret. Comput. Sci. , vol.255 , pp. 1-31
- Stirling, C.¹

14
- 0016070314
- The equivalence problem for deterministic finite-turn pushdown automata
- (1974) Inform. Control , vol.25 , pp. 123-133
- Valiant, L.G.¹

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