-
1
-
-
30244482752
-
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
-
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
-
3
-
-
0003023825
-
Monadic second-order logic and recognizability by tiling systems
-
[GRST96]
-
D. Giammarresi, A. Restivo, S. Seibert, and W. Thomas. Monadic second-order logic and recognizability by tiling systems. Information and Computation, 125:32-45, 1996.
-
(1996)
Information and Computation
, vol.125
, pp. 32-45
-
-
Giammarresi, D.1
Restivo, A.2
Seibert, S.3
Thomas, W.4
-
4
-
-
84947926600
-
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
-
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
-
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
-
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
|