Result 1 to 20 of 60 total
Comparing necessary conditions for recognizability of two-dimensional languages. (English)
Winkler, Franz (ed.), Algebraic informatics. 4th international conference, CAI 2011, Linz, Austria, June 21‒24, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21492-9/pbk). Lecture Notes in Computer Science 6742, 84-96 (2011).
1
Some results on the structure of unary unambiguous automata. (English)
Adv. Appl. Math. 47, No. 1, 88-101 (2011).
2
Classification of string languages via tiling recognizable picture languages. (English)
Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 5th international conference, LATA 2011, Tarragona, Spain, May 26‒31, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21253-6/pbk). Lecture Notes in Computer Science 6638, 105-116 (2011).
3
Comparing necessary conditions for recognizability of two-dimensional languages (English)
CAI, 84-96 (2011).
4
Classification of string languages via tiling recognizable picture languages (English)
LATA, 105-116 (2011).
5
Classes of two-dimensional languages and recognizability conditions. (English)
RAIRO, Theor. Inform. Appl. 44, No. 4, 471-488 (2010).
6
Deterministic and unambiguous families within recognizable two-dimensional languages. (English)
Fundam. Inform. 98, No. 2-3, 143-166 (2010).
7
Classes of two-dimensional languages and recognizability conditions (English)
RAIRO - Theor. Inf. and Applic. 44, No. 4, 471-488 (2010).
8
A visual bug report analysis and search tool (English)
SEKE, 742-747 (2010).
9
A note on unambiguity, finite ambiguity and complementation in recognizable two-dimensional languages. (English)
Bozapalidis, Symeon (ed.) et al., Algebraic informatics. Third international conference, CAI 2009, Thessaloniki, Greece, May 19‒22, 2009, Proceedings. Berlin: Springer (ISBN 978-3-642-03563-0/pbk). Lecture Notes in Computer Science 5725, 147-159 (2009).
10
A computational model for tiling recognizable two-dimensional languages. (English)
Theor. Comput. Sci. 410, No. 37, 3520-3529 (2009).
11
Deterministic and unambiguous two-dimensional languages over one-letter alphabet. (English)
Theor. Comput. Sci. 410, No. 16, 1477-1485 (2009).
12
Framed versus unframed two-dimensional languages. (English)
Nielsen, Mogens (ed.) et al., SOFSEM 2009: Theory and practice of computer science. 35th conference on current trends in theory and practice of computer science, Špindlerův Mlýn, Czech Republic, January 24‒30, 2009. Proceedings. Berlin: Springer (ISBN 978-3-540-95890-1/pbk). Lecture Notes in Computer Science 5404, 79-92 (2009).
13
A note on unambiguity, finite ambiguity and complementation in recognizable two-dimensional languages (English)
CAI, 147-159 (2009).
14
Um processo de validação de requisitos não-funcionais baseado no NFR-framework (English)
WER (2009).
15
Framed versus unframed two-dimensional languages (English)
SOFSEM, 79-92 (2009).
16
Deterministic two-dimensional languages over one-letter alphabet. (English)
Bozapalidis, Symeon (ed.) et al., Algebraic informatics. Second international conference, CAI 2007, Thessaloniki, Greece, May 21‒25, 2007. Revised selected and invited papers. Berlin: Springer (ISBN 978-3-540-75413-8/pbk). Lecture Notes in Computer Science 4728, 147-159 (2007).
17
Tiling automaton: A computational model for recognizable two-dimensional languages. (English)
Holub, Jan (ed.) et al., Implementation and application of automata. 12th international conference, CIAA 2007, Prague, Czech Republic, July 16‒18, 2007. Revised selected papers. Berlin: Springer (ISBN 978-3-540-76335-2/pbk). Lecture Notes in Computer Science 4783, 290-302 (2007).
18
Regular languages and associative language descriptions. (English)
Discrete Math. Theor. Comput. Sci. 9, No. 2, 153-173, electronic only (2007).
19
From determinism to non-determinism in recognizable two-dimensional languages. (English)
Harju, Tero (ed.) et al., Developments in language theory. 11th international conference, DLT 2007, Turku, Finland, July 3‒6, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73207-5/pbk). Lecture Notes in Computer Science 4588, 36-47 (2007).
20
Result 1 to 20 of 60 total