메뉴 건너뛰기




Volumn 8507 LNCS, Issue , 2014, Pages 40-53

Degrees of reversibility for DFA and DPDA

Author keywords

gradual reversibility; hierarchies of languages; lookahead; pushdown automata; Reversible finite state machines

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EID: 84905283566     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-08494-7_4     Document Type: Conference Paper
Times cited : (10)

References (11)
  • 1
    • 27344432613 scopus 로고
    • The theory of parsing, translation, and compiling
    • Prentice-Hall Inc., Englewood Cliffs
    • Aho, A.V., Ullman, J.D.: The theory of parsing, translation, and compiling. Parsing, vol. I. Prentice-Hall Inc., Englewood Cliffs (1972)
    • (1972) Parsing , vol.1
    • Aho, A.V.1    Ullman, J.D.2
  • 2
    • 84976832596 scopus 로고
    • Inference of reversible languages
    • Angluin, D.: Inference of reversible languages. J. ACM 29(3), 741-765 (1982)
    • (1982) J. ACM , vol.29 , Issue.3 , pp. 741-765
    • Angluin, D.1
  • 3
    • 79957947161 scopus 로고    scopus 로고
    • A simple and efficient universal reversible Turing machine
    • Dediu, A.-H., Inenaga, S., Martín-Vide, C. (eds.) LATA 2011. Springer, Heidelberg
    • Axelsen, H.B., Glück, R.: A simple and efficient universal reversible Turing machine. In: Dediu, A.-H., Inenaga, S., Martín-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 117-128. Springer, Heidelberg (2011)
    • (2011) LNCS , vol.6638 , pp. 117-128
    • Axelsen, H.B.1    Glück, R.2
  • 4
    • 0015680909 scopus 로고
    • Logical reversibility of computation
    • Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17, 525-532 (1973)
    • (1973) IBM J. Res. Dev. , vol.17 , pp. 525-532
    • Bennett, C.H.1
  • 5
    • 0000791686 scopus 로고
    • Two families of languages related to ALGOL
    • Ginsburg, S., Rice, H.G.: Two families of languages related to ALGOL. J. ACM 9(3), 350-371 (1962)
    • (1962) J. ACM , vol.9 , Issue.3 , pp. 350-371
    • Ginsburg, S.1    Rice, H.G.2
  • 7
    • 0031097569 scopus 로고    scopus 로고
    • Learning approximately regular languages with reversible languages
    • Kobayashi, S., Yokomori, T.: Learning approximately regular languages with reversible languages. Theoret. Comput. Sci. 174, 251-257 (1997)
    • (1997) Theoret. Comput. Sci. , vol.174 , pp. 251-257
    • Kobayashi, S.1    Yokomori, T.2
  • 9
    • 0000328287 scopus 로고
    • Irreversibility and heat generation in the computing process
    • Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5, 183-191 (1961)
    • (1961) IBM J. Res. Dev. , vol.5 , pp. 183-191
    • Landauer, R.1
  • 10
    • 0040216312 scopus 로고
    • A 1-tape 2-symbol reversible Turing machine
    • Morita, K., Shirasaki, A., Gono, Y.: A 1-tape 2-symbol reversible Turing machine. Trans. IEICE E72, 223-228 (1989)
    • (1989) Trans. IEICE , vol.E72 , pp. 223-228
    • Morita, K.1    Shirasaki, A.2    Gono, Y.3
  • 11
    • 85024910467 scopus 로고
    • On reversible automata
    • Simon, I. (ed.) LATIN 1992. Springer, Heidelberg
    • Pin, J.E.: On reversible automata. In: Simon, I. (ed.) LATIN 1992. LNCS, vol. 583, pp. 401-416. Springer, Heidelberg (1992)
    • (1992) LNCS , vol.583 , pp. 401-416
    • Pin, J.E.1


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