Undecidability of language equivalence for generalized regular expressions

被引：0

作者：

Hirshfeld, Yoram ^{[1
]}

机构：

[1] Tel Aviv Univ, Tel Aviv, Israel

来源：

Fundamenta Informaticae | 1996年 / 26卷 / 01期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：95 / 102

共 50 条

[1] Undecidability of the equivalence of finite substitutions on regular language
Halava, V
Harju, T
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1999, 33 (02): : 117 - 124
[2] On the undecidability and descriptional complexity of synchronized regular expressions
Xie, Jingnan
Hunt, Harry B. B.
ACTA INFORMATICA, 2023, 60 (03) : 257 - 278
[3] On the undecidability and descriptional complexity of synchronized regular expressions
Jingnan Xie
Harry B. Hunt
Acta Informatica, 2023, 60 : 257 - 278
[4] GENERALIZED REGULAR EXPRESSIONS - A LANGUAGE FOR SYNTHESIS OF PROGRAMS WITH BRANCHING IN LOOPS
BRAZMA, A
KINBER, E
THEORETICAL COMPUTER SCIENCE, 1986, 46 (2-3) : 175 - 195
[5] The generalized regular expressions of conditions
Popa, Emil Marin
5th RoEduNet IEEE International Conference, Proceedings, 2006, : 272 - 274
[6] EXPANDING GENERALIZED REGULAR EXPRESSIONS
COLNER, D
COMMUNICATIONS OF THE ACM, 1988, 31 (12) : 1376 - 1385
[7] Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids
Hashiguchi, K
Sakakibara, N
Jimbo, S
THEORETICAL COMPUTER SCIENCE, 2004, 312 (2-3) : 251 - 266
[8] EQUIVALENCE OF REGULAR EXPRESSIONS OVER A PARTIALLY COMMUTATIVE ALPHABET
Shoukourian, A. S.
CYBERNETICS AND SYSTEMS ANALYSIS, 2009, 45 (03) : 387 - 396
[9] ON THE EQUIVALENCE AND CONTAINMENT PROBLEMS FOR UNAMBIGUOUS REGULAR EXPRESSIONS, REGULAR GRAMMARS AND FINITE AUTOMATA
STEARNS, RE
HUNT, HB
SIAM JOURNAL ON COMPUTING, 1985, 14 (03) : 598 - 611
[10] Undecidability in ω-regular languages
Halava, Vesa
Harju, Tero
Karhumäki, Juhani
FUNDAMENTA INFORMATICAE, 2006, 73 (1-2) : 119 - 125

← 1 2 3 4 5 →