Liliana Cojocaru

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 3

Top Topics

Regular Languages

Intrinsic Complexity

Top Venues

Theor. Comput. Sci.

Publications

Liliana Cojocaru
On Some Complexity Results for Even Linear Languages. CoRR (2024)
Liliana Cojocaru
On the Complexity of Coordinated Table Selective Substitution Systems. CoRR (2022)
Liliana Cojocaru
Towards the Complexity of Petri Nets and One Counter Machines via Coordinated Table Selective Substitution Systems. SYNASC (2021)
Liliana Cojocaru
Around Context-Free Grammars - a Normal Form, a Representation Theorem, and a Regular Approximation. CoRR (2015)
Liliana Cojocaru, Erkki Mäkinen
On some derivation mechanisms and the complexity of their Szilard languages. Theor. Comput. Sci. 537 (2014)
Liliana Cojocaru, Erkki Mäkinen
Searching for Traces of Communication in Szilard Languages of Parallel Communicating Grammar Systems - Complexity Views. DCFS (2013)
Liliana Cojocaru, Erkki Mäkinen
The Complexity of Szilard Languages of Matrix Grammars Revisited. Fundam. Informaticae 123 (4) (2013)
Liliana Cojocaru
Trade-Offs Between Time, Space, Cooperation, and Communication Complexity for CD Grammar Systems. Fundam. Informaticae 107 (4) (2011)
Liliana Cojocaru, Erkki Mäkinen
On the Complexity of Szilard Languages of Regulated Grammars. ICTAC (2011)
Liliana Cojocaru, Erkki Mäkinen
On the Complexity of Szilard Languages of Matrix Grammars. SYNASC (2011)
Liliana Cojocaru, Erkki Mäkinen, Ferucio Laurentiu Tiplea
. SYNASC (2009)
Liliana Cojocaru
Branching Programs, Grammar Systems and the NC1 Class. SYNASC (2007)
Liliana Cojocaru
Characterizations of CD Grammar Systems Working in Competence Mode by Multicounter Machine Resources. Ershov Memorial Conference (2006)
Liliana Cojocaru
Watson-Crick automata and PCFAS with two components: a computational power analogy. Conf. Computing Frontiers (2004)
Liliana Cojocaru
Simulating the Process of Gene Assembly in Ciliates. CIAA (2004)
Liliana Cojocaru
On the time, space and communication complexity of q-fair languages. DCFS (2004)