메뉴 건너뛰기




Volumn 1378, Issue , 1998, Pages 203-210

On piecewise testable, starfree, and recognizable picture languages

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EID: 84947927264     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0053551     Document Type: Conference Paper
Times cited : (43)

References (8)
  • 1
    • 30244482752 scopus 로고    scopus 로고
    • The state complexity of E.L
    • [Bir96]
    • Jean-Carnille Birget. The state complexity of E.L. Information Processing Letters, 58:185-188, 1996.
    • (1996) Information Processing Letters , vol.58 , pp. 185-188
    • Birget, J.-C.1
  • 2
    • 0011975194 scopus 로고    scopus 로고
    • Two-dimensional languages
    • G. Rozen-berg and A. Salomaa, editors, Springer-Verlag, New York, [GR96]
    • D. Giammaxresi and A. Restivo. Two-dimensional languages. In G. Rozen-berg and A. Salomaa, editors, Handbook of Formal Language Theory, volume III. Springer-Verlag, New York, 1996.
    • (1996) Handbook of Formal Language Theory , vol.3
    • Giammaxresi, D.1    Restivo, A.2
  • 4
    • 84947926600 scopus 로고    scopus 로고
    • A lower bound technique for the size of nondeterministic finite automata
    • [GS96]
    • Ian Glaister and Jeffrey Shallit. A lower bound technique for the size of nondeterministic finite automata. Information Processing Letters, 125:3245, 1996.
    • (1996) Information Processing Letters , vol.125 , pp. 3245
    • Glaister, I.1    Shallit, J.2
  • 6
    • 84949641867 scopus 로고    scopus 로고
    • Regular expressions and context-free grammars for picture languages
    • Riidiger Reischuk, editor, Lübeck, Germany. Springer-Verlag. [Mat97]
    • Oliver Matz. Regular expressions and context-free grammars for picture languages. In Riidiger Reischuk, editor, STAGS’97, volume 1200 of Lect. Notes Comput. Sci., pages 283-294, Lübeck, Germany, 1997. Springer-Verlag.
    • (1997) STAGS’97, volume 1200 of Lect. Notes Comput. Sci , pp. 283-294
    • Matz, O.1
  • 7
    • 0030718787 scopus 로고    scopus 로고
    • The monadic quantifier alternation hierarchy over graphs is infinite
    • Warsaw, Poland. IEEE. [MT97]
    • Oliver Matz and Wolfgang Thomas. The monadic quantifier alternation hierarchy over graphs is infinite. In Twelfth Annual IEEE Symposium on Logic in Computer Science, pages 236-244, Warsaw, Poland, 1997. IEEE.
    • (1997) Twelfth Annual IEEE Symposium on Logic in Computer Science , pp. 236-244
    • Matz, O.1    Thomas, W.2
  • 8
    • 21744460612 scopus 로고    scopus 로고
    • Star-free picture expressions are strictly weaker than first-order logic
    • Pierpaolo Degano, Roberto Gorrieri, and Alberto Marchetti-Spaccamela, editors, Bologna, Italy. Springer. [Wil97]
    • Thomas Wilke. Star-free picture expressions are strictly weaker than first-order logic. In Pierpaolo Degano, Roberto Gorrieri, and Alberto Marchetti-Spaccamela, editors, Automata, Languages and Programming, volume 1256 of Lect. Notes Comput. Sci., pages 347-357, Bologna, Italy, 1997. Springer.
    • (1997) Automata, Languages and Programming, volume 1256 of Lect. Notes Comput. Sci , pp. 347-357
    • Wilke, T.1


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