Liliana Cojocaru

According to our database1, Liliana Cojocaru authored at least 17 papers between 2004 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On Some Complexity Results for Even Linear Languages.
CoRR, 2024

2022
On the Complexity of Coordinated Table Selective Substitution Systems.
CoRR, 2022

2021
Towards the Complexity of Petri Nets and One Counter Machines via Coordinated Table Selective Substitution Systems.
Proceedings of the 23rd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2021

2016
Advanced Studies on the Complexity of Formal Languages ; Tutkimuksia formaalien kielten laskennallisesta vaativuudesta.
PhD thesis, 2016

2015
Around Context-Free Grammars - a Normal Form, a Representation Theorem, and a Regular Approximation.
CoRR, 2015

2014
On some derivation mechanisms and the complexity of their Szilard languages.
Theor. Comput. Sci., 2014

2013
The Complexity of Szilard Languages of Matrix Grammars Revisited.
Fundam. Informaticae, 2013

Searching for Traces of Communication in Szilard Languages of Parallel Communicating Grammar Systems - Complexity Views.
Proceedings of the Descriptional Complexity of Formal Systems, 2013

2011
Trade-Offs Between Time, Space, Cooperation, and Communication Complexity for CD Grammar Systems.
Fundam. Informaticae, 2011

On the Complexity of Szilard Languages of Matrix Grammars.
Proceedings of the 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2011

On the Complexity of Szilard Languages of Regulated Grammars.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2011 - 8th International Colloquium, Johannesburg, South Africa, August 31, 2011

2009
Classes of Szilard Languages in NC<sup>1</sup>.
Proceedings of the 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2009

2007
Branching Programs, Grammar Systems and the NC1 Class.
Proceedings of the Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2007

2006
Characterizations of CD Grammar Systems Working in Competence Mode by Multicounter Machine Resources.
Proceedings of the Perspectives of Systems Informatics, 2006

2004
Simulating the Process of Gene Assembly in Ciliates.
Proceedings of the Implementation and Application of Automata, 2004

On the time, space and communication complexity of q-fair languages.
Proceedings of the 6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26, 2004

Watson-Crick automata and PCFAS with two components: a computational power analogy.
Proceedings of the First Conference on Computing Frontiers, 2004


  Loading...