Henning Fernau

According to our database1, Henning Fernau
  • authored at least 260 papers between 1991 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Characterization and complexity results on jumping finite automata.
Theor. Comput. Sci., 2017

On the computational completeness of graph-controlled insertion-deletion systems with binary sizes.
Theor. Comput. Sci., 2017

Contextual array grammars with matrix control, regular control languages, and tissue P systems control.
Theor. Comput. Sci., 2017

Combinatorial Properties and Recognition of Unit Square Visibility Graphs.
CoRR, 2017

Problems on Finite Automata and the Exponential Time Hypothesis.
Algorithms, 2017

Computational Completeness of Path-Structured Graph-Controlled Insertion-Deletion Systems.
Proceedings of the Implementation and Application of Automata, 2017

Universal Matrix Insertion Grammars with Small Size.
Proceedings of the Unconventional Computation and Natural Computation, 2017

Parikh Images of Matrix Ins-Del Systems.
Proceedings of the Theory and Applications of Models of Computation, 2017

Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearity.
Proceedings of the Descriptional Complexity of Formal Systems, 2017

2016
Parameterized Algorithms for Drawing Graphs.
Encyclopedia of Algorithms, 2016

Kernelization, Turing Kernels.
Encyclopedia of Algorithms, 2016

On the Parameterised Complexity of String Morphism Problems.
Theory Comput. Syst., 2016

Data reductions and combinatorial bounds for improved approximation algorithms.
J. Comput. Syst. Sci., 2016

An Essay on General Grammars.
Journal of Automata, Languages and Combinatorics, 2016

Polynomial inference of universal automata from membership and equivalence queries.
Inf. Comput., 2016

Weak total resolvability in graphs.
Discussiones Mathematicae Graph Theory, 2016

Diminishable Parameterized Problems and Strict Polynomial Kernelization.
CoRR, 2016

Theorietage der Gesellschaft für Informatik in Speyer 2015 - Special Issue.
Algorithms, 2016

Problems on Finite Automata and the Exponential Time Hypothesis.
Proceedings of the Implementation and Application of Automata, 2016

Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion.
Proceedings of the Unconventional Computation and Natural Computation, 2016

Upper Domination: Complexity and Approximation.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Building Clusters with Lower-Bounded Sizes.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

On the Complexity of Grammar-Based Compression over Fixed Alphabets.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems.
Proceedings of the Descriptional Complexity of Formal Systems, 2016

Contextual Array Grammars with Matrix and Regular Control.
Proceedings of the Descriptional Complexity of Formal Systems, 2016

Two-Dimensional Input-Revolving Automata.
Proceedings of the Computational Modeling of Objects Presented in Images. Fundamentals, Methods, and Applications, 2016

Picture Scanning Automata.
Proceedings of the Computational Modeling of Objects Presented in Images. Fundamentals, Methods, and Applications, 2016

On the Complexity Landscape of the Domination Chain.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

Algorithmic Aspects of Upper Domination: A Parameterised Perspective.
Proceedings of the Algorithmic Aspects in Information and Management, 2016

2015
Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps.
TOCT, 2015

On the parameterized complexity of vertex cover and edge cover with connectivity constraints.
Theor. Comput. Sci., 2015

Combinatorics for smaller kernels: The differential of a graph.
Theor. Comput. Sci., 2015

A multi-parameter analysis of hard problems on deterministic finite automata.
J. Comput. Syst. Sci., 2015

Computing the metric dimension for chain graphs.
Inf. Process. Lett., 2015

The Finite Index Restriction Meets Hybrid Modes in Cooperating Distributed Grammar Systems.
Int. J. Found. Comput. Sci., 2015

Pattern matching with variables: A multivariate complexity analysis.
Inf. Comput., 2015

Characterization and Complexity Results on Jumping Finite Automata.
CoRR, 2015

Algorithmic Aspects of Upper Domination.
CoRR, 2015

Contextual array grammars and array P systems.
Ann. Math. Artif. Intell., 2015

Jumping Finite Automata: Characterizations and Complexity.
Proceedings of the Implementation and Application of Automata, 2015

Kernelization Algorithms for Packing Problems Allowing Overlaps.
Proceedings of the Theory and Applications of Models of Computation, 2015

Pattern Matching with Variables: Fast Algorithms and New Hardness Results.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Non-isometric Contextual Array Grammars with Regular Control and Local Selectors.
Proceedings of the Machines, Computations, and Universality - 7th International Conference, 2015

Scanning Pictures the Boustrophedon Way.
Proceedings of the Combinatorial Image Analysis - 17th International Workshop, 2015

2014
A survey on alliances and related parameters in graphs.
EJGTA, 2014

An Amortized Search Tree Analysis for Finding a k-Leaf Spanning Tree in an Undirected Graph.
Discrete Mathematics & Theoretical Computer Science, 2014

The complexity of probabilistic lobbying.
Discrete Optimization, 2014

Digraphs of bounded elimination width.
Discrete Applied Mathematics, 2014

Computing the differential of a graph: Hardness, approximability and exact algorithms.
Discrete Applied Mathematics, 2014

Kernelization Algorithms for Packing Problems Allowing Overlaps.
CoRR, 2014

Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes.
Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

Data Reductions and Combinatorial Bounds for Improved Approximation Algorithms.
CoRR, 2014

Latrunculi - on the complexity of Roman chess.
Proceedings of the Sixth Workshop on Non-Classical Models for Automata and Applications, 2014

Approximation Algorithms Inspired by Kernelization Methods.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results.
Proceedings of the Computer Science - Theory and Applications, 2014

2013
A novel parameterised approximation algorithm for minimum vertex cover.
Theor. Comput. Sci., 2013

Packing paths: Recycling saves time.
Discrete Applied Mathematics, 2013

Exact and Parameterized Algorithms for Max Internal Spanning Tree.
Algorithmica, 2013

Array Insertion and Deletion P Systems.
Proceedings of the Unconventional Computation and Natural Computation, 2013

Two-dimensional pattern languages.
Proceedings of the Fifth Workshop on Non-Classical Models for Automata and Applications - NCMA 2013, Umeå, Sweden, August 13, 2013

A Multivariate Analysis of Some DFA Problems.
Proceedings of the Language and Automata Theory and Applications, 2013

MAT Learning of Universal Automata.
Proceedings of the Language and Automata Theory and Applications, 2013

On the Parameterised Complexity of String Morphism Problems.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

Pattern Matching with Variables: A Multivariate Complexity Analysis.
Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

2012
On families of categorial grammars of bounded value, their learnability and related complexity questions.
Theor. Comput. Sci., 2012

Kernel(s) for problems with no kernel: On out-trees with many leaves.
ACM Trans. Algorithms, 2012

An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem.
J. Discrete Algorithms, 2012

From the Guest Editors.
J. Comput. Syst. Sci., 2012

Constraint bipartite vertex cover: simpler exact algorithms and implementations.
J. Comb. Optim., 2012

Lower bounds on the differential of a graph.
Discrete Mathematics, 2012

Parameterized Measure & Conquer for Problems with No Small Kernels.
Algorithmica, 2012

An Exact Exponential Time Algorithm for Power Dominating Set.
Algorithmica, 2012

Saving on Phases: Parameterized Approximation for Total Vertex Cover.
Proceedings of the Combinatorial Algorithms, 23rd International Workshop, 2012

Cooperating Distributed Tree Automata.
Proceedings of the Languages Alive, 2012

Kernels for Packing and Covering Problems - (Extended Abstract).
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011
An exact algorithm for the Maximum Leaf Spanning Tree problem.
Theor. Comput. Sci., 2011

Breaking the 2n-barrier for Irredundance: Two lines of attack.
J. Discrete Algorithms, 2011

Charge and reduce: A fixed-parameter algorithm for String-to-String Correction.
Discrete Optimization, 2011

Facility location problems: A parameterized view.
Discrete Applied Mathematics, 2011

Parameterized Approximation Algorithms for Hitting Set.
Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011

Computing the differential of a graph.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

On the Expressive Power of Valences in Cooperating Distributed Grammar Systems.
Proceedings of the Computation, 2011

2010
Parameterized algorithms for d-Hitting Set: The weighted case.
Theor. Comput. Sci., 2010

A new upper bound for Max-2-SAT: A graph-theoretic approach.
J. Discrete Algorithms, 2010

Comparing trees via crossing minimization.
J. Comput. Syst. Sci., 2010

Exact exponential-time algorithms for finding bicliques.
Inf. Process. Lett., 2010

Parameterized algorithmics for d-Hitting Set.
Int. J. Comput. Math., 2010

minimum dominating set of queens: A trivial programming exercise?
Discrete Applied Mathematics, 2010

A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set.
Algorithmica, 2010

An Amortized Search Tree Analysis for k-Leaf Spanning Tree.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach.
Proceedings of the Language and Automata Theory and Applications, 2010

Enumerate and Measure: Improving Parameter Budget Management.
Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

Ranking and Drawing in Subexponential Time.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Combining Two Worlds: Parameterised Approximation for Vertex Cover.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Hölder Norms and a Hierarchy Theorem for Parameterized Classes of CCG.
Proceedings of the Grammatical Inference: Theoretical Results and Applications, 2010

A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem.
Proceedings of the Computer Science, 2010

The Curse of Connectivity: t-Total Vertex (Edge) Cover.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

A Parameterized Route to Exact Puzzles: Breaking the 2n-Barrier for Irredundance.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

A Fixed-Parameter Algorithm for String-to-String Correction.
Proceedings of the Theory of Computing 2010, 2010

2009
Vertex and edge covers with clustering properties: Complexity and algorithms.
J. Discrete Algorithms, 2009

A parameterized perspective on packing paths of length two.
J. Comb. Optim., 2009

Algorithms for learning regular expressions from positive data.
Inf. Comput., 2009

On the complement graph and defensive k-alliances.
Discrete Applied Mathematics, 2009

Offensive r-alliances in graphs.
Discrete Applied Mathematics, 2009

A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem
CoRR, 2009

Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles
CoRR, 2009

The Complexity of Probabilistic Lobbying
CoRR, 2009

Exact and Parameterized Algorithms for Max Internal Spanning Tree.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

Searching Trees: An Essay.
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

An Exact Algorithm for the Maximum Leaf Spanning Tree Problem.
Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

Packing Paths: Recycling Saves Time.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

Exact Exponential-Time Algorithms for Finding Bicliques in a Graph.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

The Complexity of Probabilistic Lobbying.
Proceedings of the Algorithmic Decision Theory, First International Conference, 2009

2008
Parameterized Algorithms for Drawing Graphs.
Proceedings of the Encyclopedia of Algorithms, 2008

Fixed parameter algorithms for one-sided crossing minimization revisited.
J. Discrete Algorithms, 2008

A bounded search tree algorithm for parameterized face cover.
J. Discrete Algorithms, 2008

ROMAN DOMINATION: a parameterized perspective.
Int. J. Comput. Math., 2008

Comparison of some descriptional complexities of 0L systems obtained by a unifying approach.
Inf. Comput., 2008

Blind Counter Automata on omega-Words.
Fundam. Inform., 2008

A sum labelling for the generalised friendship graph.
Discrete Mathematics, 2008

Parameterized algorithmics for linear arrangement problems.
Discrete Applied Mathematics, 2008

Exact Exponential Time Algorithms for Max Internal Spanning Tree
CoRR, 2008

Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves
CoRR, 2008

A Parameterized Perspective on P2-Packings
CoRR, 2008

A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach
CoRR, 2008

Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs.
Proceedings of the WALCOM: Algorithms and Computation, Second International Workshop, 2008

Local elimination-strategies in automata for shorter regular expressions.
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Volume II, 2008

A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

Power Domination in O*(1.7548n) Using Reference Search Trees.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

An Optimal Construction of Finite Automata from Regular Expressions.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

Constraint Bipartite Vertex Cover: Simpler Exact Algorithms and Implementations.
Proceedings of the Frontiers in Algorithmics, Second Annual International Workshop, 2008

Global r-alliances and total domination.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

A Parameterized Perspective on Packing Paths of Length Two.
Proceedings of the Combinatorial Optimization and Applications, 2008

Facility Location Problems: A Parameterized View.
Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size.
SIAM J. Comput., 2007

Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars.
Journal of Automata, Languages and Combinatorics, 2007

The Degree of Parallelism.
Journal of Automata, Languages and Combinatorics, 2007

Decidability of code properties.
ITA, 2007

Learning tree languages from text.
ITA, 2007

Programmed Grammars with Rule Queues.
Int. J. Found. Comput. Sci., 2007

Alliances in Graphs: a Complexity-Theoretic Study.
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

Comparison of Some Descriptional Complexities of 0L Systems Obtained by a Unifying Approach.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

Exact Elimination of Cycles in Graphs.
Proceedings of the Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07., 2007

Dynamic programming for queen domination.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

2006
Iterated sequential transducers as language generating devices.
Theor. Comput. Sci., 2006

Speeding up Exact Algorithms With High Probability.
Electronic Notes in Discrete Mathematics, 2006

Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs.
Electronic Notes in Discrete Mathematics, 2006

Parameterized Algorithms for Hitting Set: the Weighted Case.
Electronic Colloquium on Computational Complexity (ECCC), 2006

ROMAN DOMINATION: A Parameterized Perspective.
Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

NONBLOCKER: Parameterized Algorithmics for minimum dominating set.
Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

edge dominating set: Efficient Enumeration-Based Exact Algorithms.
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

Kernels: Annotated, Proper and Induced.
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

Parameterized Algorithms for Hitting Set: The Weighted Case.
Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms.
Proceedings of the Algorithms and Complexity in Durham 2006, 2006

2005
Two-Layer Planarization: Improving on Parameterized Algorithmics.
J. Graph Algorithms Appl., 2005

A refined search tree technique for Dominating Set on planar graphs.
J. Comput. Syst. Sci., 2005

Representations of Recursively Enumerable Array Languages by Contextual Array Grammars.
Fundam. Inform., 2005

Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size.
Proceedings of the STACS 2005, 2005

Two-Layer Planarization: Improving on Parameterized Algorithmics.
Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, 2005

Comparing Trees Via Crossing Minimization.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

Refining the Nonterminal Complexity of Graph-controlled Grammars.
Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005

The degree of parallelism.
Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005

Algorithms for Learning Regular Expressions.
Proceedings of the Algorithmic Learning Theory, 16th International Conference, 2005

Asymptotically Faster Algorithms for Parameterized FACE COVER.
Proceedings of the Algorithms and Complexity in Durham 2005, 2005

2004
Parameterized complexity: exponential speed-up for planar graph problems.
J. Algorithms, 2004

Grammar Induction: An Invitation to Formal Language Theorists.
Grammars, 2004

Introduction to the Special Issue on Grammar Induction.
Grammars, 2004

Two-Layer Planarization: Improving on Parameterized Algorithmics
Electronic Colloquium on Computational Complexity (ECCC), 2004

A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set
Electronic Colloquium on Computational Complexity (ECCC), 2004

Parametric Duality: Kernel Sizes and Algorithmics
Electronic Colloquium on Computational Complexity (ECCC), 2004

Identifying Terminal Distinguishable Languages.
Ann. Math. Artif. Intell., 2004

A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

The Boisdale Algorithm - An Induction Method for a Subclass of Unification Grammar from Positive Data.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2004

Extracting Minimum Length Document Type Definitions Is NP-Hard.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2004

2003
On the degree of scattered context-sensitivity.
Theor. Comput. Sci., 2003

Hybrid modes in cooperating distributed grammar systems: combining the t-mode with the modes le k and =k.
Theor. Comput. Sci., 2003

Nonterminal complexity of programmed grammars.
Theor. Comput. Sci., 2003

Identification of function distinguishable languages.
Theor. Comput. Sci., 2003

Graph separators: a parameterized view.
J. Comput. Syst. Sci., 2003

A simultaneous reduction of several measures of descriptional complexity in scattered context grammars.
Inf. Process. Lett., 2003

Parallel Grammars: A Phenomenology.
Grammars, 2003

Education(al) matters: teaching P versus NP.
Bulletin of the EATCS, 2003

Fixed Parameter Algorithms for one-sided crossing minimization Revisited.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

On the parameterized complexity of the generalized rush hour puzzle.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

On Iterated Sequential Transducers.
Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003

2002
Sequential grammars and automata with valences.
Theor. Comput. Sci., 2002

Even linear simple matrix languages: formal language properties and grammatical inference.
Theor. Comput. Sci., 2002

Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components.
Journal of Automata, Languages and Combinatorics, 2002

Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs.
Algorithmica, 2002

Graph Separator Algorithms: A Refined Analysis.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

Algorithms for Learning Function Distinguishable Regular Languages.
Proceedings of the Structural, 2002

Fragmentation: Enhancing Identifiability.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2002

Learning Tree Languages from Text.
Proceedings of the Computational Learning Theory, 2002

On Parameterized Enumeration.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001
Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization.
Theor. Comput. Sci., 2001

An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover.
J. Algorithms, 2001

Iterated Function Systems and Control Languages.
Inf. Comput., 2001

Valences in Lindenmayer Systems.
Fundam. Inform., 2001

Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems
Electronic Colloquium on Computational Complexity (ECCC), 2001

Parallel communicating grammar systems with terminal transmission.
Acta Inf., 2001

Approximative Learning of Regular Languages.
Proceedings of the SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24, 2001

Learning XML Grammars.
Proceedings of the Machine Learning and Data Mining in Pattern Recognition, 2001

Refined Search Tree Technique for DOMINATING SET on Planar Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

Nonterminal Complexity of Programmed Grammars.
Proceedings of the Machines, 2001

Finding Optimal Solutions to Atomix.
Proceedings of the KI 2001: Advances in Artificial Intelligence, 2001

Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Valuated and Valence Grammars: An Algebraic View.
Proceedings of the Developments in Language Theory, 5th International Conference, 2001

Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components.
Proceedings of the Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures - DCAGRS 2001, Vienna, Austria, July 20, 2001

Graph Separators: A Parameterized View.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

Valence Grammars with Target Sets.
Proceedings of the Words, Semigroups, and Transductions, 2001

Regularly controlled formal power series.
Proceedings of the Where Mathematics, 2001

2000
Regulated Grammars under Leftmost Derivation.
Grammars, 2000

Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems.
Proceedings of the Algorithm Theory, 2000

k-gram Extensions of Terminal Distinguishable Languages.
Proceedings of the 15th International Conference on Pattern Recognition, 2000

Permutations and Control Sets for Learning Non-regular Language Families.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2000

External Contextual and Conditional Languages.
Proceedings of the Recent Topics in Mathematical and Computational Linguistics, 2000

Terminal distinguishable languages.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2000

Identification of Function Distinguishable Languages.
Proceedings of the Algorithmic Learning Theory, 11th International Conference, 2000

1999
Characterizations of Recursively Enumerable Sets by Programmed Grammars With Unconditional Transfer.
Journal of Automata, Languages and Combinatorics, 1999

On the Leftmost Derivation in Matrix Grammars.
Int. J. Found. Comput. Sci., 1999

On Accepting Pure Lindenmayer Systems.
Fundam. Inform., 1999

An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover.
Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

Regulated Array Grammars of Finite Index. Part II: Syntactic Pattern Recognition.
Proceedings of the Grammatical Models of Multi-Agent Systems, 1999

Regulated Array Grammars of Finite Index. Part I: Theoretical Investigations.
Proceedings of the Grammatical Models of Multi-Agent Systems, 1999

Decidability of code properties.
Proceedings of the Developments in Language Theory, 1999

Efficient Learning of Some Linear Matrix Languages.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998
Remarks on Regulated Limited ET0L Systems and Regulated Context-Free Grammars.
Theor. Comput. Sci., 1998

Character Recognition with k-Head Finite Array Automata.
Proceedings of the Advances in Pattern Recognition, 1998

Regulated Grammars with Leftmost Derivation.
Proceedings of the SOFSEM '98: Theory and Practice of Informatics, 1998

IFS and Control Languages.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

The Generative Power of d-Dimensional #-Context-Free Array Grammars.
Proceedings of the International Colloquium Universal Machines and Computations, 1998

1997
Graph-Controlled Grammars as Language Acceptors.
Journal of Automata, Languages and Combinatorics, 1997

Unconditional Transfer in Regulated Rewriting.
Acta Inf., 1997

Regulations by Valences.
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

How Powerful is Unconditional Transfer? - When UT meets AC.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997

Bounding resources in Cooperating Distributed Grammar Systems.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997

Conditional Context-Free Languages of Finite Index.
Proceedings of the New Trends in Formal Languages, 1997

Accepting Array Grammars with Control Mechanisms.
Proceedings of the New Trends in Formal Languages, 1997

1996
Remarks on Propagating Partition-Limited ETOL Systems.
J. UCS, 1996

Membership for k-Limited ET0L Languages Is Not Decidable.
Journal of Automata, Languages and Combinatorics, 1996

Accepting Grammars and Systems via Context Condition Grammars.
Journal of Automata, Languages and Combinatorics, 1996

On Grammar and Language Families.
Fundam. Inform., 1996

Closure Properties of Ordered Languages.
Bulletin of the EATCS, 1996

Accepting Multi-Agent Systems.
Computers and Artificial Intelligence, 1996

Accepting Multi-Agent Systems II.
Acta Cybern., 1996

Bounded Parallelism in Array Grammars Used for Character Recognition.
Proceedings of the Advances in Structural and Syntactical Pattern Recognition, 1996

On Unconditional Transfer.
Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

Advocating Ownership.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1996

1995
Valuations of Languages, with Applications to Fractal Geometry.
Theor. Comput. Sci., 1995

A Note on Uniformly Limited ETOL Systems with Unique Interpretation.
Inf. Process. Lett., 1995

A predicate for separating language classes.
Bulletin of the EATCS, 1995

Valuations, regular expressions, and fractal geometry.
Appl. Algebra Eng. Commun. Comput., 1995

Accepting Grammars and Systems: An Overview.
Proceedings of the Developments in Language Theory II, 1995

1994
Iterierte Funktionen, Sprachen und Fraktale.
PhD thesis, 1994

Membership for 1-Limited ET0L Languages Is Not Decidable.
Elektronische Informationsverarbeitung und Kybernetik, 1994

Valuations and Unambiguity of Languages, with Applications to Fractal Geometry.
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1993
Adult Languages of Propagating Systems with Restricted Parallelism.
Elektronische Informationsverarbeitung und Kybernetik, 1993

Remarks on Adult Languages of Propagating Systems with Restricted Parallelism.
Proceedings of the Developments in Language Theory, 1993

1991
On Function-limited Lindenmayer Systems.
Elektronische Informationsverarbeitung und Kybernetik, 1991


  Loading...