| Publication | Date of Publication | Type |
|---|
Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars
Electronic Proceedings in Theoretical Computer Science | 2024-04-09 | Paper |
On the generative capacity of contextual grammars with strictly locally testable selection languages
| 2024-02-06 | Paper |
Relations of contextual grammars with strictly locally testable selection languages
RAIRO - Theoretical Informatics and Applications | 2024-02-02 | Paper |
Merging two hierarchies of external contextual grammars with subregular selection
Descriptional Complexity of Formal Systems | 2023-08-17 | Paper |
A survey on computationally complete accepting and generating networks of evolutionary processors
| 2022-12-09 | Paper |
Accepting networks of evolutionary processors with resources restricted and structure limited filters
RAIRO - Theoretical Informatics and Applications | 2022-01-12 | Paper |
Generative capacity of contextual grammars with subregular selection languages
Fundamenta Informaticae | 2021-11-15 | Paper |
scientific article; zbMATH DE number 7347652 (Why is no real title available?)
| 2021-05-12 | Paper |
scientific article; zbMATH DE number 7315103 (Why is no real title available?)
| 2021-02-24 | Paper |
Networks with evolutionary processors and ideals and codes as filters
International Journal of Foundations of Computer Science | 2020-02-21 | Paper |
On bonded sequential and parallel insertion systems
RAIRO - Theoretical Informatics and Applications | 2019-07-18 | Paper |
Accepting networks of evolutionary processors with subregular filters
| 2016-07-26 | Paper |
On the power of accepting networks of evolutionary processors with special topologies and random context filters
Fundamenta Informaticae | 2016-05-11 | Paper |
Networks of evolutionary processors: computationally complete normal forms
Natural Computing | 2016-03-09 | Paper |
On subregular selection languages in internal contextual grammars
| 2015-03-16 | Paper |
A comparison of the descriptional complexity of classes of limited Lindenmayer systems. II
| 2015-03-16 | Paper |
Accepting networks of evolutionary processors with subregular filters
Theory of Computing Systems | 2015-02-05 | Paper |
Networks of evolutionary processors: the power of subregular filters
Acta Informatica | 2013-06-26 | Paper |
Generating networks of splicing processors
RAIRO - Theoretical Informatics and Applications | 2012-11-22 | Paper |
On Internal Contextual Grammars with Subregular Selection Languages
Descriptional Complexity of Formal Systems | 2012-11-02 | Paper |
A comparison of the descriptional complexity of classes of limited Lindenmayer systems. I.
International Journal of Foundations of Computer Science | 2012-08-30 | Paper |
On external contextual grammars with subregular selection languages
Theoretical Computer Science | 2012-08-13 | Paper |
On networks of evolutionary processors with filters accepted by two-state-automata
Fundamenta Informaticae | 2012-05-04 | Paper |
On contextual grammars with subregular selection languages
Descriptional Complexity of Formal Systems | 2011-07-29 | Paper |
The role of evolutionary operations in accepting hybrid networks of evolutionary processors
Information and Computation | 2011-07-27 | Paper |
On normal forms for networks of evolutionary processors
Lecture Notes in Computer Science | 2011-06-17 | Paper |
Networks of evolutionary processors with subregular filters
Language and Automata Theory and Applications | 2011-06-03 | Paper |
Low disruption transformations on cyclic automata
Fundamenta Informaticae | 2011-05-18 | Paper |
Target based accepting networks of evolutionary processors
Fundamenta Informaticae | 2011-05-18 | Paper |
Generative capacity of subregularly tree controlled grammars
International Journal of Foundations of Computer Science | 2010-11-11 | Paper |
Two collapsing hierarchies of subregularly tree controlled languages
Theoretical Computer Science | 2009-08-07 | Paper |
On Networks of Evolutionary Processors with Nodes of Two Types
| 2009-06-23 | Paper |
On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes
Language and Automata Theory and Applications | 2009-04-02 | Paper |
On the Power of Networks of Evolutionary Processors
Lecture Notes in Computer Science | 2009-03-05 | Paper |
REMARKS ON CONTEXT-FREE PARALLEL COMMUNICATING GRAMMAR SYSTEMS GENERATING CROSSED AGREEMENTS
International Journal of Foundations of Computer Science | 2008-09-25 | Paper |
On the number of components for some parallel communicating grammar systems
Theoretical Computer Science | 2007-12-19 | Paper |
The finiteness of synchronous, tabled picture languages is decidable
Theoretical Computer Science | 2007-01-09 | Paper |
scientific article; zbMATH DE number 2213331 (Why is no real title available?)
| 2006-01-26 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2005-12-22 | Paper |
scientific article; zbMATH DE number 2051902 (Why is no real title available?)
| 2004-03-07 | Paper |
