|
2010
Adrian Horia Dediu, Cătălin Ionuţ
Tîrnăucă.
Evolutionary
Algorithms for Parsing Tree Adjoining
Grammars. In:
Gemma Bel Enguix and Maria Dolores Jiménez Lopez (eds.),
Linguistics, Biology and Computer Science: Interplays,
Cambridge Scholars, To
appear.
PDF
Bibtex
EE
Cristina
Tîrnăucă,
Cătălin Ionuţ
Tîrnăucă.
Types of Trusted Information that Make DFA Identification
Feasible with Correction Queries.
In: Mike Domarantzki and Kai Salomaa (Eds.), Proceedings of the
15th International Conference on Implementation and
Application of Automata (CIAA 2010), LNCS, Springer, 2010.
PDF
Bibtex
EE
Andreas Maletti, Cătălin Ionuţ
Tîrnăucă.
Properties of Quasi-Relabeling Tree Bimorphisms.
International Journal of Foundations of Computer Science, 21
(3), 2010, 257-276.
PDF
Bibtex
EE
2009
Cătălin Ionuţ
Tîrnăucă.
Model Syntax-Directed
Translations by Tree Transducers. In: Henning Bordihn, Rudolf
Freund, Markus Holzer, Martin Kutrib and Friedrich Otto (Eds.), Proceedings
of the Workshop on Non-Classical Models for Automata and
Applications (NMCA 2009, Wroclaw, Poland), Österreichischen Computer
Gesellschaft, ISBN 978-3-85403-256-4, pp. 209-220.
PDF
Bibtex
EE
Magnus Steinby,
Cătălin
Ionuţ
Tîrnăucă.
Defining Syntax-Directed Translations by Tree Bimorphisms.
Theoretical
Computer Science, 410 (37), 2009,
3495-3503.
PDF
Bibtex
EE
Mihai
Ionescu, Cătălin Ionuţ
Tîrnăucă, Cristina
Tîrnăucă.
Dreams and Spiking
Neural P Systems. Romanian Journal of Information, Science and
Technology, 12 (2), 2009, pp.209-217.
PDF
Bibtex
EE
Andreas Maletti,
Cătălin Ionuţ
Tîrnăucă. Syntax-Directed Translations and
Quasi-Alphabetic Tree Bimorphisms - Revisited. In: Symeon
Bozapalidis and George Rahonis (eds.), Proceedings 3rd
International Conference of Algebraic Informatics (CAI 2009,
Thessaloniki, Greece), LNCS 5725, Springer, 2009, pp. 305-317.
PDF
Bibtex
EE
Adrian Horia Dediu, Cătălin Ionuţ
Tîrnăucă.
Parsing Tree Adjoining
Grammars Using Evolutionary Algorithms. In: Joaquim Filipe, Ana
Fred and Bernadette Sharp (eds.), Proceedings of the 1st
International Conference on Agents and Artificial Intelligence (ICAART 2009, Porto,
Portugal). ISBN 978-989-8111-73-9, pp. 632-639.
PDF
Bibtex
EE
2008
Cătălin
Ionuţ
Tîrnăucă.
Tree
Bimorphisms and Their Relevance in the Theory of Translations.
In: Antonio Moreno Sandoval (ed), Actas del VIII Congreso de Lingüística General
(CLG 2008, Madrid, Spain). ISBN: 978-84-691-4124-3, pp. 1893-1912.
PDF
Bibtex
EE
Cătălin
Ionuţ
Tîrnăucă.
Synchronous Context-Free Grammars Translations by Means of Tree Bimorphisms.
Submitted to Fundamenta Informaticae (May 2008).
PDF
Bibtex
EE
2007
Cătălin
Ionuţ
Tîrnăucă.
Synchronous Context-Free Grammars Translations by Means of Tree Bimorphisms.
In: Gemma Bel Enguix and Maria Dolores Jiménez Lopez (eds.),
Proceedings of the 1st
International Workshop on Non-Classical Formal Languages in
Linguistics (ForLing 2007, Budapest, Hungary), GRLMC Reports 36/07, 2007, pp. 97-107.
PDF
Bibtex
EE
Magnus Steinby,
Cătălin
Ionuţ
Tîrnăucă.
Syntax-Directed Translations and Quasi-Alphabetic Tree Bimorphisms.
In: Jan Holub and Jan Zdárek (eds.), Proceedings of the 12th
International Conference on Implementation and Application of
Automata (CIAA 2007, Prague, Czech Republic), LNCS 4783, Springer, 2007, pp. 265-276.
PDF
Bibtex
EE
Cătălin Ionuţ Tîrnăucă,
Cristina Tîrnăucă. Learning Regular Tree Languages from Correction
and Equivalence Queries. Journal of Automata, Languages and Combinatorics,
12(4), 2007, pp. 501-524.
PDF
Bibtex
EE
|