메뉴 건너뛰기
Acta Informatica
Volumn 33, Issue 5, 1996, Pages 409-420
Forgetting automata and context-free languages
Author keywords

[No Author keywords available]
Indexed keywords

EID: 0039562798     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050050     Document Type: Article
Times cited : (11)
References (9)
  • 1
    • 4243558005 scopus 로고
    • Finite change automata
    • Proc. 4th GI Conf. on Theoretical Computer Science Berlin: Springer
    • von Braunmühl B., Verbeek R.: Finite change automata. Proc. 4th GI Conf. on Theoretical Computer Science (Lect. Notes in Comput. Sci., vol. 67, pp. 91-100) Berlin: Springer 1979
    • (1979) Lect. Notes in Comput. Sci. , vol.67 , pp. 91-100
    • Von Braunmühl, B.1    Verbeek, R.2
  • 2
    • 0039996680 scopus 로고
    • Categorial grammars and list automata for strata of non-CF-languages
    • Buszkowski, W., Marciszewski, W., van Benthem, J. (eds.) John Benjamin, Amsterdam, Philadelphia
    • Chytil, M.P., Karlgren H.: Categorial grammars and list automata for strata of non-CF-languages. In: Buszkowski, W., Marciszewski, W., van Benthem, J. (eds.) Categorial grammars, John Benjamin, Amsterdam, Philadelphia 1988
    • (1988) Categorial Grammars
    • Chytil, M.P.1    Karlgren, H.2
  • 3
    • 0000348710 scopus 로고
    • The hardest context-free language
    • Greibach, S.A.: The hardest context-free language. SIAM J. Comput. 2, 304-310 (1973)
    • (1973) SIAM J. Comput. , vol.2 , pp. 304-310
    • Greibach, S.A.1
  • 4
    • 0041183958 scopus 로고
    • A generalization of context-free determinism
    • Hibbard, T.N.: A generalization of context-free determinism. Inform, and Control 11, 196-238 (1967)
    • (1967) Inform, and Control , vol.11 , pp. 196-238
    • Hibbard, T.N.1
  • 5
    • 25744467454 scopus 로고
    • Nondeterministic forgetting automata are less powerful than deterministic linear bounded automata
    • Ostrava
    • Jančar, P.: Nondeterministic forgetting automata are less powerful than deterministic linear bounded automata. Acta Math, et Inf. Univ. Ostraviensis, 1, Ostrava, 1993, pp.67-73
    • (1993) Acta Math, et Inf. Univ. Ostraviensis , vol.1 , pp. 67-73
    • Jančar, P.1
  • 6
    • 25744444194 scopus 로고
    • Characterization of context-free languages by erasing auto-mata
    • Proc. MFCS'92, Prague, Czechoslovakia, August 1992, Berlin: Springer
    • Jančar P., Mráz, F., Plátek, M.: Characterization of context-free languages by erasing auto-mata; In: Proc. MFCS'92, Prague, Czechoslovakia, August 1992, (Lect. Notes in Comput. Sci., Vol. 629, pp. 305-314) Berlin: Springer 1992
    • (1992) Lect. Notes in Comput. Sci. , vol.629 , pp. 305-314
    • Jančar, P.1
  • 7
    • 0039996732 scopus 로고
    • A taxonomy of forgetting automata
    • Proc. MFCS 1993, Gdańsk, Poland, September 1993, Berlin: Springer
    • Jančar, P., Mráz, F., Plátek, M.: A taxonomy of forgetting automata. In: Proc. MFCS 1993, Gdańsk, Poland, September 1993, (Lect. Notes in Comput. Sci., Vol. 711, pp. 527-536) Berlin: Springer 1993
    • (1993) Lect. Notes in Comput. Sci. , vol.711 , pp. 527-536
    • Jančar, P.1    Mráz, F.2    Plátek, M.3

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