Jürgen Dassow

J. Autom. Lang. Comb., 2023

Relations of contextual grammars with strictly locally testable selection languages.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2023

25 Editions of DCFS: Origins and Directions.

[BibT_eX]

[DOI]

Martin Kutrib

Giovanni Pighizzini

Bull. EATCS, 2023

2022

On the Generative Capacity of Contextual Grammars with Strictly Locally Testable Selection Languages.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 12th International Workshop on Non-Classical Models of Automata and Applications, 2022

Operational complexity and pumping lemmas.

[BibT_eX]

[DOI]

Ismaël Jecker

Acta Informatica, 2022

2021

Remarks on external contextual grammars with selection.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Accepting networks of evolutionary processors with resources restricted and structure limited filters.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2021

Further Remarks on the Operational Nonterminal Complexity.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2021

Some remarks on the orbit of closure-involution operations on languages.

[BibT_eX]

[DOI]

Inf. Comput., 2021

Operational complexity and right linear grammars.

[BibT_eX]

[DOI]

Acta Informatica, 2021

2020

Generating Networks of Evolutionary Processors with Resources Restricted and Structure Limited Filters.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2020

Lindenmayer Systems with Control by Ideals and Codes.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2020

Networks with Evolutionary Processors and Ideals and Codes as Filters.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2020

2019

On the orbit of closure-involution operations - The case of formal languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Operational Accepting State Complexity: The Unary and Finite Case.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2019

2018

Grammars with Control by Ideals and Codes.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2018

2017

Descriptional Complexity and Operations - Two Non-classical Cases.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2017

2016

On the Number of Accepting States of Finite Automata.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2016

Editorial.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2016

2015

On the Power of Accepting Networks of Evolutionary Processors with Special Topologies and Random Context Filters.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2015

Conditional Lindenmayer Systems with Subregular Conditions: The Extended Case.

[BibT_eX]

[DOI]

Stefan Rudolf

Acta Cybern., 2015

2014

Editorial.

[BibT_eX]

[DOI]

Jozef Kelemen

J. Autom. Lang. Comb., 2014

Conditional Lindenmayer systems with subregular conditions: The non-extended case.

[BibT_eX]

[DOI]

Stefan Rudolf

RAIRO Theor. Informatics Appl., 2014

Regular languages of partial words.

[BibT_eX]

[DOI]

Robert Mercas

Inf. Sci., 2014

Inner Palindromic Closure.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2014

Conditional Lindenmayer Systems with Conditions Defined by Bounded Resources.

[BibT_eX]

[DOI]

Proceedings of the Computing with New Resources, 2014

Restarting Automata with Subregular Constraints.

[BibT_eX]

Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014

2013

Networks of evolutionary processors: the power of subregular filters.

[BibT_eX]

[DOI]

Acta Informatica, 2013

Accepting splicing systems with permitting and forbidding words.

[BibT_eX]

[DOI]

José-Ramón Sánchez-Couso

Acta Informatica, 2013

2012

Language classes generated by tree controlled grammars with bounded nonterminal complexity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

On external contextual grammars with subregular selection languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Networks of evolutionary processors: computationally complete normal forms.

[BibT_eX]

[DOI]

Nat. Comput., 2012

On restricted context-free grammars.

[BibT_eX]

[DOI]

Tomás Masopust

J. Comput. Syst. Sci., 2012

On Subregular Selection Languages in Internal Contextual Grammars.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2012

Editorial.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2012

Descriptional Complexity of Union and Star on Context-Free Languages.

[BibT_eX]

[DOI]

Ronny Harbich

J. Autom. Lang. Comb., 2012

Generating Networks of Splicing Processors.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2012

Extended Splicing Systems with Subregular Sets of Splicing Rules.

[BibT_eX]

Proceedings of the Fourth Workshop on Non-Classical Models for Automata and Applications, 2012

Subregular Restrictions for Some Language Generating Devices.

[BibT_eX]

Proceedings of the Fourth Workshop on Non-Classical Models for Automata and Applications, 2012

Production Complexity of Some Operations on Context-Free Languages.

[BibT_eX]

[DOI]

Ronny Harbich

Proceedings of the Descriptional Complexity of Formal Systems, 2012

Connecting Partial Words and Regular Languages.

[BibT_eX]

[DOI]

Robert Mercas

Proceedings of the How the World Computes, 2012

2011

Nonterminal complexity of tree controlled grammars.

[BibT_eX]

[DOI]

Mohd Hasan Selamat

Theor. Comput. Sci., 2011

Graph grammars with string-regulated rewriting.

[BibT_eX]

[DOI]

Daniel Lobo

Theor. Comput. Sci., 2011

Selected Papers Dedicated to Friedrich Otto on the Occasion of his 60th Birthday - Editorial.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2011

On the Number of Active Symbols in Lindenmayer Systems.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

The role of evolutionary operations in accepting hybrid networks of evolutionary processors.

[BibT_eX]

[DOI]

Inf. Comput., 2011

On Networks of Evolutionary Processors with Filters Accepted by Two-State-Automata.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

On Normal Forms for Networks of Evolutionary Processors.

[BibT_eX]

[DOI]

Proceedings of the Unconventional Computation - 10th International Conference, 2011

Networks of Evolutionary Processors with Subregular Filters.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2011

Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity.

[BibT_eX]

[DOI]

Mohd Hasan Selamat

Proceedings of the Descriptional Complexity of Formal Systems, 2011

On Contextual Grammars with Subregular Selection Languages.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2011

2010

Editorial.

[BibT_eX]

[DOI]

Giovanni Pighizzini

J. Autom. Lang. Comb., 2010

Extending regular expressions with homomorphic replacement.

[BibT_eX]

[DOI]

Markus Holzer

RAIRO Theor. Informatics Appl., 2010

Generative Capacity of Subregularly Tree Controlled Grammars.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2010

Variants of Competence-Based Derivations in CD Grammar Systems.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2010

Low Disruption Transformations on Cyclic Automata.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2010

Accepting Hybrid Networks of Evolutionary Processors with Special Topologies and Small Communication

[BibT_eX]

[DOI]

Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

Petri Net Controlled Grammars with a Bounded Number of Additional Places.

[BibT_eX]

[DOI]

Acta Cybern., 2010

On Networks of Evolutionary Processors with State Limited Filters.

[BibT_eX]

Proceedings of the Second Workshop on Non-Classical Models for Automata and Applications - NCMA 2010, Jena, Germany, August 23, 2010

2009

Accepting Networks of Non-inserting Evolutionary Processors.

[BibT_eX]

[DOI]

Trans. Comp. Sys. Biology, 2009

Two collapsing hierarchies of subregularly tree controlled languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Some operations preserving primitivity of words.

[BibT_eX]

[DOI]

Gema M. Martín

Theor. Comput. Sci., 2009

Petri Net Controlled Grammars: the Case of Special Petri Nets.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2009

Editorial.

[BibT_eX]

[DOI]

Andreas Malcher

J. Autom. Lang. Comb., 2009

A Similarity Measure for Cyclic Unary Regular Languages.

[BibT_eX]

[DOI]

Gema M. Martín

Fundam. Informaticae, 2009

On Networks of Evolutionary Processors with Nodes of Two Types.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2009

Evolving Under Small Disruption.

[BibT_eX]

Gema M. Martín

Proceedings of the Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31, 2009

Grammars Controlled by Special Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2009

Conditional Grammars with Commutative, Circular and Locally Testable Conditions.

[BibT_eX]

Proceedings of the Automata, Formal Languages, and Related Topics, 2009

2008

Comparison of some descriptional complexities of 0L systems obtained by a unifying approach.

[BibT_eX]

[DOI]

Henning Fernau

Inf. Comput., 2008

Nonterminal Complexity of Some Operations on Context-Free Languages.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2008

k-Petri Net Controlled Grammars.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2008

Some New Modes of Competence-Based Derivations in CD Grammar Systems.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 12th International Conference, 2008

On Two Hierarchies of Subregularly Tree Controlled Languages.

[BibT_eX]

Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

Subregularly Tree Controlled Grammars and Languages.

[BibT_eX]

Proceedings of the Automata and Formal Languages, 12th International Conference, 2008

2007

On the number of components for some parallel communicating grammar systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

On Cooperating Distributed Grammar Systems with Competence Based Start and Stop Conditions.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2007

On the Power of Networks of Evolutionary Processors.

[BibT_eX]

[DOI]

Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007

Some Remarks on Homogeneous Generating Networks of Free Evolutionary Processors.

[BibT_eX]

[DOI]

Carlos Martín-Vide

Proceedings of the Formal Models, 2007

2006

CD grammar systems with competence based entry conditions in their cooperation protocols.

[BibT_eX]

[DOI]

Markus Holzer

Int. J. Comput. Math., 2006

P Finite Automata and Regular Languages over Countably Infinite Alphabets.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 7th International Workshop, 2006

Ciliate Bio-operations on Finite String Multisets.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 10th International Conference, 2006

On the Degree Complexity of Special Non-Context-Free Languages with Respect to PC Grammar Systems.

[BibT_eX]

Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

2005

Language families defined by a ciliate bio-operation: hierarchies and decision problems.

[BibT_eX]

[DOI]

Markus Holzer

Int. J. Found. Comput. Sci., 2005

Contextual Grammars with Subregular Choice.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2005

A remark on evolutionary systems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

2004

Editorial.

[BibT_eX]

[DOI]

Detlef Wotschke

J. Autom. Lang. Comb., 2004

On differentiation functions, structure functions, and related languages of context-free grammars.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2004

On The Descriptional Complexity Of Lindenmayer Systems.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2004

A Ciliate Bio-operation and Language Families.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 2004

On the Size of Components of Probabilistic Cooperating Distributed Grammar Systems.

[BibT_eX]

[DOI]

Proceedings of the Theory Is Forever, 2004

2002

Operations and language generating devices suggested by the genome evolution.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Some Remarks on Codes Defined by Petri Nets.

[BibT_eX]

[DOI]

Masami Ito

J. Univers. Comput. Sci., 2002

Editorial.

[BibT_eX]

[DOI]

Detlef Wotschke

Bernd Reichel

J. Autom. Lang. Comb., 2002

On the Descriptional Complexity of Some Variants of Lindenmayer Systems.

[BibT_eX]

[DOI]

Taishin Y. Nishida

Bernd Reichel

Proceedings of the Developments in Language Theory, 6th International Conference, 2002

2001

P Systems with Communication Based on Concentration.

[BibT_eX]

[DOI]

Acta Cybern., 2001

Tree-systems of morphisms.

[BibT_eX]

[DOI]

Acta Informatica, 2001

Subregularly controlled derivations: restrictions by syntactic parameters.

[BibT_eX]

Proceedings of the Where Mathematics, 2001

Conditional Grammars with Restrictions by Syntactic Parameters.

[BibT_eX]

Proceedings of the Words, Semigroups, and Transductions, 2001

2000

Editorial.

[BibT_eX]

[DOI]

Detlef Wotschke

J. Autom. Lang. Comb., 2000

Finite Automata over Free Groups.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2000

Parallel Communicating Grammar Systems As Language Analyzers.

[BibT_eX]

[DOI]

Grammars, 2000

Conditional Concatenation.

[BibT_eX]

[DOI]

Carlos Martín-Vide

Alfonso Rodríguez-Patón

Fundam. Informaticae, 2000

Parikh Mapping and Iteration.

[BibT_eX]

[DOI]

Proceedings of the Multiset Processing, 2000

On the Differentiation Function of some Language Generating Devices.

[BibT_eX]

Proceedings of the International Colloquium on Words, 2000

1999

On the Power of Membrane Computing.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 1999

Stack Cooperation in Multistack Pushdown Automata.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1999

Min of Mat is not Necessarily Mat.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

On the Leftmost Derivation in Matrix Grammars.

[BibT_eX]

[DOI]

Henning Fernau

Int. J. Found. Comput. Sci., 1999

On the Regularity of Duplication Closure.

[BibT_eX]

Bull. EATCS, 1999

On the Regularity of Languages Generated by Context-free Evolutionary Grammars.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

CD Grammar Systems Versus L Systems.

[BibT_eX]

Proceedings of the Grammatical Models of Multi-Agent Systems, 1999

Grammar Systems as Language Analyzers and Recursively Enumerable Languages.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

Numerical Parameters of Evolutionary Grammars.

[BibT_eX]

Proceedings of the Jewels are Forever, 1999

1998

Convex and anti-convex languages.

[BibT_eX]

[DOI]

Solomon Marcus

Int. J. Comput. Math., 1998

Remarks on Operations Suggested by Mutations in Genomes.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1998

Some Remarks on Networks of Parallel Language Processors.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Current Trends in Computing, 1998

1997

Grammars with Controlled Derivations.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Formal Languages, 1997

Grammar Systems.

[BibT_eX]

[DOI]

Grzegorz Rozenberg

Proceedings of the Handbook of Formal Languages, 1997

Cooperation in Context-Free Grammars.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

Point mutations in context-free languages.

[BibT_eX]

Proceedings of the 3rd International Conference Developments in Language Theory, 1997

Some Remarks on Extended Reular Languages.

[BibT_eX]

Proceedings of the 3rd International Conference Developments in Language Theory, 1997

1996

Splicing Grammar Systems.

[BibT_eX]

[DOI]

Comput. Artif. Intell., 1996

Fairness in Grammar Systems.

[BibT_eX]

[DOI]

Acta Cybern., 1996

Evolutionary Grammars: A Granunatical Model for Genome Evolution.

[BibT_eX]

Proceedings of the German Conference on Bioinformatics, 1996

Evolutionary Grammars: A Grammatical Model for Genome Evolution.

[BibT_eX]

[DOI]

Proceedings of the Bioinformatics, German Conference on Bioinformatics, Leipzig, 1996

1995

Cooperating Array Grammar Systems.

[BibT_eX]

[DOI]

Rudolf Freund

Int. J. Pattern Recognit. Artif. Intell., 1995

On the Generative Capacity of Certain Classes of Cooperating Grammar Systems.

[BibT_eX]

[DOI]

Sorina Vicolov

Fundam. Informaticae, 1995

1994

Chain-Code Pictures and Collages Generated by Hyperedge Replacement.

[BibT_eX]

[DOI]

Annegret Habel

Stefan Taubenberger

Proceedings of the Graph Gramars and Their Application to Computer Science, 1994

Decision Problems for Edge Grammars.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

On the Size of Components of Cooperating Grammar Systems.

[BibT_eX]

[DOI]

Stefan Skalla

Proceedings of the Results and Trends in Theoretical Computer Science, 1994

1993

Language-theoretic problems arising from Richelieu cryptosystems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

Deterministic Soliton Automata with at Most One Cycle.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1993

Efficient Reductions of Picture Words.

[BibT_eX]

[DOI]

Franz-Josef Brandenburg

RAIRO Theor. Informatics Appl., 1993

Dynamically controlled cooperating/distributed grammar systems.

[BibT_eX]

[DOI]

Inf. Sci., 1993

On the Union of 0L Languages.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1993

Grammars Based on Patterns.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1993

Decision Problems and Regular Chain Code Picture Languages.

[BibT_eX]

[DOI]

Friedhelm Hinz

Discret. Appl. Math., 1993

Iterative Reading of Numbers: The Ordered Case.

[BibT_eX]

Solomon Marcus

Proceedings of the Developments in Language Theory, 1993

A Note on the Degree of Nondeterminism.

[BibT_eX]

Proceedings of the Developments in Language Theory, 1993

1992

On cooperating/distributed grammar systems with different styles of acceptance.

[BibT_eX]

[DOI]

Jozef Kelemen

Int. J. Comput. Math., 1992

Regularizing Context-Free Languages by AFL Operations: Concatenation and Kleene Closure.

[BibT_eX]

[DOI]

Acta Cybern., 1992

1991

Deterministic Soliton Automata with a Single Exterior Node.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

On the Connectedness of Pictures in Chain Code Picture Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

On Bounded Interpretations of Grammar Forms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

Cooperating/distributed grammar systems with hypothesis languages.

[BibT_eX]

[DOI]

J. Exp. Theor. Artif. Intell., 1991

Cooperating/Distributed Grammar Systems: a Link between Formal Languages and Artificial Intelligence.

[BibT_eX]

Jozef Kelemen

Bull. EATCS, 1991

Computational Calculus and Hardest Languages of Automata with Abstract Storages.

[BibT_eX]

[DOI]

Klaus-Jörn Lange

Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1990

Soliton Automata.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1990

On the relations between the degree of synchronization and the degree of nondeterminism in k-limited and uniformly k-limited tol systems.

[BibT_eX]

[DOI]

Dietmar Wätjen

Int. J. Comput. Math., 1990

On the degree of non-regularity of context-free languages.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 1990

Information transmission in il systems.

[BibT_eX]

[DOI]

Wolfgang Rülling

Int. J. Comput. Math., 1990

On Cooperating/Distributed Grammar Systems.

[BibT_eX]

J. Inf. Process. Cybern., 1990

1989

Graph-theoretical Properties and Chain Code Picture Languages.

[BibT_eX]

J. Inf. Process. Cybern., 1989

A undecidability result for regular anguages and its applications to regulated rewriting.

[BibT_eX]

Friedhelm Hinz

Bull. EATCS, 1989

On the Power of Synchronization in Parallel Computations.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

Regulated Rewriting in Formal Language Theory.

[BibT_eX]

[DOI]

Springer, ISBN: 978-3-642-74934-6, 1989

1988

A Remark on Limited OL Systems.

[BibT_eX]

J. Inf. Process. Cybern., 1988

Pure languages of regulated rewriting and their codings.

[BibT_eX]

[DOI]

Acta Cybern., 1988

1985

Further remarks on the complexity of regulated rewriting.

[BibT_eX]

[DOI]

Kybernetika, 1985

On Ordered Variants of Some Regulated Grammars.

[BibT_eX]

J. Inf. Process. Cybern., 1985

1984

A note on DTOL Systems.

[BibT_eX]

Bull. EATCS, 1984

On some extensions of Russian parallel context free grammars.

[BibT_eX]

[DOI]

Acta Cybern., 1984

1983

A note on programmed 0L systems.

[BibT_eX]

[DOI]

Inf. Sci., 1983

1982

L(ETOL[5]) = L(ETOL).

[BibT_eX]

J. Inf. Process. Cybern., 1982

Remark on a Problem of Nguyen Xuan My and Paun.

[BibT_eX]

J. Inf. Process. Cybern., 1982

Grammars with valuations - a discrete model for self-organization of biopolymers.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1982

1981

Equality Languages and Language Families.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1981

1980

On some extensions of Indian parallel context free grammars.

[BibT_eX]

[DOI]

Acta Cybern., 1980

1979

On the Circular Closure of Languages.

[BibT_eX]

J. Inf. Process. Cybern., 1979

1977

Some Remarks on the Algebra of Automation Mapping.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1977

1976

Eine neue Funktion für Lindenmayer-Systeme.

[BibT_eX]

J. Inf. Process. Cybern., 1976

1975

Über metrische Kleene-Vollständigkeit.

[BibT_eX]

J. Inf. Process. Cybern., 1975

1974

Kleene-Vollständigkeit bei stark-definiten Ereignissen.

[BibT_eX]

J. Inf. Process. Cybern., 1974

Kleene-Mengen und Kleene-Vollständigkeit.

[BibT_eX]