Bianca Truthe
According to our database1,
Bianca Truthe
authored at least 54 papers
between 2003 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:
-
at zbmath.org
-
at orcid.org
On csauthors.net:
Bibliography
2018
Networks of evolutionary processors with resources restricted filters.
Proceedings of the Tenth Workshop on Non-Classical Models of Automata and Applications, 2018
2017
TCS Special Issue on Languages and Combinatorics in Theory and Nature.
Theor. Comput. Sci., 2017
Selected papers of the 8th International Conference on Language and Automata Theory and Applications (LATA 2014).
Inf. Comput., 2017
Hierarchies of language families of contextual grammars.
Proceedings of the Ninth Workshop on Non-Classical Models of Automata and Applications, 2017
2016
Preface.
Journal of Automata, Languages and Combinatorics, 2016
Editorial.
Journal of Automata, Languages and Combinatorics, 2016
7th International Conference on Language and Automata Theory and Applications (LATA 2013).
Inf. Comput., 2016
On bonded sequential and parallel insertion systems.
Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016
2015
On the Power of Accepting Networks of Evolutionary Processors with Special Topologies and Random Context Filters.
Fundam. Inform., 2015
On relations between some subregular language families.
Proceedings of the Seventh Workshop on Non-Classical Models of Automata and Applications - NCMA 2015, Porto, Portugal, August 31, 2015
2014
Guest Editors' Note - Special Issue: First International Conference on the Theory and Practice of Natural Computing, TPNC 2012.
Parallel Processing Letters, 2014
Preface.
RAIRO - Theor. Inf. and Applic., 2014
6th International Conference on Language and Automata Theory and Applications (LATA 2012).
Inf. Comput., 2014
A relation between definite and ordered finite automata.
Proceedings of the Sixth Workshop on Non-Classical Models for Automata and Applications, 2014
2013
Networks of evolutionary processors: the power of subregular filters.
Acta Inf., 2013
Computationally complete chains of evolutionary processors with random context filters.
Proceedings of the Fifth Workshop on Non-Classical Models for Automata and Applications - NCMA 2013, Umeå, Sweden, August 13, 2013
2012
On external contextual grammars with subregular selection languages.
Theor. Comput. Sci., 2012
Networks of evolutionary processors: computationally complete normal forms.
Natural Computing, 2012
A Comparison of the Descriptional Complexity of Classes of Limited Lindenmayer Systems.
Journal of Automata, Languages and Combinatorics, 2012
On Subregular Selection Languages in Internal Contextual Grammars.
Journal of Automata, Languages and Combinatorics, 2012
A Comparison of the Descriptional Complexity of Classes of Limited Lindenmayer Systems: Part I.
Int. J. Found. Comput. Sci., 2012
Extended Splicing Systems with Subregular Sets of Splicing Rules.
Proceedings of the Fourth Workshop on Non-Classical Models for Automata and Applications, 2012
On Internal Contextual Grammars with Subregular Selection Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2012
2011
Selected Papers Dedicated to Friedrich Otto on the Occasion of his 60th Birthday - Editorial.
Journal of Automata, Languages and Combinatorics, 2011
3rd International Conference on Language and Automata Theory and Applications (LATA 2009).
Inf. Comput., 2011
The role of evolutionary operations in accepting hybrid networks of evolutionary processors.
Inf. Comput., 2011
On Networks of Evolutionary Processors with Filters Accepted by Two-State-Automata.
Fundam. Inform., 2011
On Normal Forms for Networks of Evolutionary Processors.
Proceedings of the Unconventional Computation - 10th International Conference, 2011
Generating Networks of Splicing Processors.
Proceedings of the Third Workshop on Non-Classical Models for Automata and Applications - NCMA 2011, Milan, Italy, July 18, 2011
Networks of Evolutionary Processors with Subregular Filters.
Proceedings of the Language and Automata Theory and Applications, 2011
On Contextual Grammars with Subregular Selection Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2011
Accepting Networks of Evolutionary Processors with Subregular Filters.
Proceedings of the Automata and Formal Languages, 13th International Conference, 2011
2010
Editorial.
Journal of Automata, Languages and Combinatorics, 2010
Generative Capacity of Subregularly Tree Controlled Grammars.
Int. J. Found. Comput. Sci., 2010
Target Based Accepting Networks of Evolutionary Processors.
Fundam. Inform., 2010
Low Disruption Transformations on Cyclic Automata.
Fundam. Inform., 2010
On the Descriptional Complexity of Limited Propagating Lindenmayer Systems
Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010
On Networks of Evolutionary Processors with State Limited Filters.
Proceedings of the Second Workshop on Non-Classical Models for Automata and Applications - NCMA 2010, Jena, Germany, August 23, 2010
2009
Two collapsing hierarchies of subregularly tree controlled languages.
Theor. Comput. Sci., 2009
On Networks of Evolutionary Processors with Nodes of Two Types.
Fundam. Inform., 2009
Target Based Accepting Networks of Evolutionary Processors with Regular Filters.
Proceedings of the Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31, 2009
On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes.
Proceedings of the Language and Automata Theory and Applications, 2009
2008
On Two Hierarchies of Subregularly Tree Controlled Languages.
Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008
Subregularly Tree Controlled Grammars and Languages.
Proceedings of the Automata and Formal Languages, 12th International Conference, 2008
2007
On the number of components for some parallel communicating grammar systems.
Theor. Comput. Sci., 2007
Preface: Aspects in Language and Automata Theory Special Issue Dedicated to JÜrgen Dassow.
Int. J. Found. Comput. Sci., 2007
On the Power of Networks of Evolutionary Processors.
Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007
Remarks on Context-Free Parallel Communicating Grammar Systems Generating Crossed Agreements.
Proceedings of the 9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20, 2007
2006
The finiteness of synchronous, tabled picture languages is decidable.
Theor. Comput. Sci., 2006
On the Degree Complexity of Special Non-Context-Free Languages with Respect to PC Grammar Systems.
Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006
2005
Endlichkeit von Bildsprachen synchroner, kontextfreier Ketten-Code-Bild-Systeme.
PhD thesis, 2005
On the Finiteness of Picture Languages of Synchronous Deterministic Chain Code Picture Systems.
Acta Cybern., 2005
2004
A Method for Deciding the Finiteness of Deterministic Tabled Picture Languages.
Proceedings of the Developments in Language Theory, 2004
2003
On the Finiteness of Picture Languages of synchronous, simple non-deterministic Chain Code Picture Systems.
Fundam. Inform., 2003