Henning Fernau

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

An Optimal Construction of Finite Automata from Regular Expressions.

[BibT_eX]

[DOI]

Stefan Gulan

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

Global r-alliances and total domination.

[BibT_eX]

Juan Alberto Rodríguez-Velázquez

José María Sigarreta

Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

2007

Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size.

[BibT_eX]

[DOI]

SIAM J. Comput., 2007

Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2007

The Degree of Parallelism.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2007

Decidability of code properties.

[BibT_eX]

[DOI]

Klaus Reinhardt

RAIRO Theor. Informatics Appl., 2007

Learning tree languages from text.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2007

Programmed Grammars with Rule Queues.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2007

Alliances in Graphs: a Complexity-Theoretic Study.

[BibT_eX]

Daniel Raible

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

Exact Elimination of Cycles in Graphs.

[BibT_eX]

[DOI]

Daniel Raible

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

Dynamic programming for queen domination.

[BibT_eX]

Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

2006

Iterated sequential transducers as language generating devices.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Speeding up Exact Algorithms With High Probability.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs.

[BibT_eX]

[DOI]

Faisal N. Abu-Khzam

Electron. Notes Discret. Math., 2006

Parameterized Algorithms for Hitting Set: the Weighted Case.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2006

NONBLOCKER: Parameterized Algorithmics for minimum dominating set.

[BibT_eX]

[DOI]

Frank K. H. A. Dehne

Michael R. Fellows

Elena Prieto-Rodriguez

Frances A. Rosamond

Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

edge dominating set: Efficient Enumeration-Based Exact Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

Kernels: Annotated, Proper and Induced.

[BibT_eX]

[DOI]

Faisal N. Abu-Khzam

Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

2005

Two-Layer Planarization: Improving on Parameterized Algorithmics.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2005

A refined search tree technique for Dominating Set on planar graphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2005

Representations of Recursively Enumerable Array Languages by Contextual Array Grammars.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2005

Refining the Nonterminal Complexity of Graph-controlled Grammars.

[BibT_eX]

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

Algorithms for Learning Regular Expressions.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 16th International Conference, 2005

Asymptotically Faster Algorithms for Parameterized FACE COVER.

[BibT_eX]

Faisal N. Abu-Khzam

Michael A. Langston

Proceedings of the Algorithms and Complexity in Durham 2005, 2005

2004

Grammar Induction: An Invitation to Formal Language Theorists.

[BibT_eX]

[DOI]

Colin de la Higuera

Grammars, 2004

Introduction to the Special Issue on Grammar Induction.

[BibT_eX]

[DOI]

Grammars, 2004

Parametric Duality: Kernel Sizes and Algorithmics

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2004

Identifying Terminal Distinguishable Languages.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2004

Complexity of a {0, 1}-matrix problem.

[BibT_eX]

[DOI]

Australas. J Comb., 2004

A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs.

[BibT_eX]

[DOI]

David W. Juedes

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.

[BibT_eX]

[DOI]

Bradford Starkie

Proceedings of the Grammatical Inference: Algorithms and Applications, 2004

Extracting Minimum Length Document Type Definitions Is NP-Hard.

[BibT_eX]

[DOI]

Proceedings of the Grammatical Inference: Algorithms and Applications, 2004

2003

On the degree of scattered context-sensitivity.

[BibT_eX]

[DOI]

Alexander Meduna

Theor. Comput. Sci., 2003

Hybrid modes in cooperating distributed grammar systems: combining the t-mode with the modes le k and =k.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Nonterminal complexity of programmed grammars.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Identification of function distinguishable languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Graph separators: a parameterized view.

[BibT_eX]

[DOI]

Jochen Alber

Rolf Niedermeier

J. Comput. Syst. Sci., 2003

A simultaneous reduction of several measures of descriptional complexity in scattered context grammars.

[BibT_eX]

[DOI]

Alexander Meduna

Inf. Process. Lett., 2003

Parallel Grammars: A Phenomenology.

[BibT_eX]

[DOI]

Grammars, 2003

Education(al) matters: teaching P versus NP.

[BibT_eX]

Bull. EATCS, 2003

On the parameterized complexity of the generalized rush hour puzzle.

[BibT_eX]

[DOI]

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

On Iterated Sequential Transducers.

[BibT_eX]

Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003

2002

Sequential grammars and automata with valences.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Even linear simple matrix languages: formal language properties and grammatical inference.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2002

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

[BibT_eX]

[DOI]

Algorithmica, 2002

Graph Separator Algorithms: A Refined Analysis.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

Algorithms for Learning Function Distinguishable Regular Languages.

[BibT_eX]

[DOI]

Agnes Radl

Proceedings of the Structural, 2002

Fragmentation: Enhancing Identifiability.

[BibT_eX]

[DOI]

Proceedings of the Grammatical Inference: Algorithms and Applications, 2002

On Parameterized Enumeration.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001

Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover.

[BibT_eX]

[DOI]

Rolf Niedermeier

J. Algorithms, 2001

Iterated Function Systems and Control Languages.

[BibT_eX]

[DOI]

Inf. Comput., 2001

Valences in Lindenmayer Systems.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2001

Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems

[BibT_eX]

[DOI]

Jochen Alber

Rolf Niedermeier

Electron. Colloquium Comput. Complex., 2001

Parallel communicating grammar systems with terminal transmission.

[BibT_eX]

[DOI]

Acta Informatica, 2001

Approximative Learning of Regular Languages.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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

Finding Optimal Solutions to Atomix.

[BibT_eX]

[DOI]

Proceedings of the KI 2001: Advances in Artificial Intelligence, 2001

Even Linear Simple Matrix Languages: Formal Language Aspects.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics, 2001

Valuated and Valence Grammars: An Algebraic View.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 5th International Conference, 2001

Valence Grammars with Target Sets.

[BibT_eX]

Proceedings of the Words, Semigroups, and Transductions, 2001

Regularly controlled formal power series.

[BibT_eX]

Werner Kuich

Proceedings of the Where Mathematics, 2001

2000

Regulated Grammars under Leftmost Derivation.

[BibT_eX]

[DOI]

Grammars, 2000

Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2000

k-gram Extensions of Terminal Distinguishable Languages.

[BibT_eX]

[DOI]

Proceedings of the 15th International Conference on Pattern Recognition, 2000

Permutations and Control Sets for Learning Non-regular Language Families.

[BibT_eX]

[DOI]

José M. Sempere

Proceedings of the Grammatical Inference: Algorithms and Applications, 2000

External Contextual and Conditional Languages.

[BibT_eX]

Proceedings of the Recent Topics in Mathematical and Computational Linguistics, 2000

Terminal distinguishable languages.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2000

1999

Characterizations of Recursively Enumerable Languages by Programmed Grammars With Unconditional Transfer.

[BibT_eX]

[DOI]

Frank Stephan

J. Autom. Lang. Comb., 1999

On the Leftmost Derivation in Matrix Grammars.

[BibT_eX]

[DOI]

Jürgen Dassow

Gheorghe Paun

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

On Accepting Pure Lindenmayer Systems.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1999

Regulated Array Grammars of Finite Index. Part II: Syntactic Pattern Recognition.

[BibT_eX]

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

Regulated Array Grammars of Finite Index. Part I: Theoretical Investigations.

[BibT_eX]

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

Efficient Learning of Some Linear Matrix Languages.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998

Remarks on Regulated Limited ET0L Systems and Regulated Context-Free Grammars.

[BibT_eX]

[DOI]

Dietmar Wätjen

Theor. Comput. Sci., 1998

Character Recognition with k-Head Finite Array Automata.

[BibT_eX]

[DOI]

Proceedings of the Advances in Pattern Recognition, 1998

Regulated Grammars with Leftmost Derivation.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM '98: Theory and Practice of Informatics, 1998

IFS and Control Languages.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

The Generative Power of d-Dimensional #-Context-Free Array Grammars.

[BibT_eX]

Proceedings of the International Colloquium Universal Machines and Computations, 1998

1997

Graph-Controlled Grammars as Language Acceptors.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 1997

Unconditional Transfer in Regulated Rewriting.

[BibT_eX]

[DOI]

Acta Informatica, 1997

Regulations by Valences.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

How Powerful is Unconditional Transfer? - When UT meets AC.

[BibT_eX]

Frank Stephan

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

Bounding resources in Cooperating Distributed Grammar Systems.

[BibT_eX]

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

Conditional Context-Free Languages of Finite Index.

[BibT_eX]

[DOI]

Proceedings of the New Trends in Formal Languages, 1997

Accepting Array Grammars with Control Mechanisms.

[BibT_eX]

[DOI]

Proceedings of the New Trends in Formal Languages, 1997

1996

Remarks on Propagating Partition-Limited ETOL Systems.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 1996

Membership for k-Limited ET0L Languages is not Decidable.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 1996

Accepting Grammars and Systems via Context Condition Grammars.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 1996

On Grammar and Language Families.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1996

Closure Properties of Ordered Languages.

[BibT_eX]

Bull. EATCS, 1996

Accepting Multi-Agent Systems.

[BibT_eX]

[DOI]

Comput. Artif. Intell., 1996

Accepting Multi-Agent Systems II.

[BibT_eX]

[DOI]

Acta Cybern., 1996

Bounded Parallelism in Array Grammars Used for Character Recognition.

[BibT_eX]

[DOI]

Proceedings of the Advances in Structural and Syntactical Pattern Recognition, 1996

On Unconditional Transfer.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

Advocating Ownership.

[BibT_eX]

[DOI]

Klaus-Jörn Lange

Klaus Reinhardt

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

1995

Valuations of Languages, with Applications to Fractal Geometry.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

A Note on Uniformly Limited ETOL Systems with Unique Interpretation.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

Remarks on accepting parallel systems.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 1995

A predicate for separating language classes.

[BibT_eX]

Bull. EATCS, 1995

Valuations, regular expressions, and fractal geometry.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 1995

Accepting Grammars and Systems: An Overview.

[BibT_eX]

Proceedings of the Developments in Language Theory II, 1995

1994

Iterierte Funktionen, Sprachen und Fraktale.

[BibT_eX]

[DOI]

PhD thesis, 1994

Membership for 1-Limited ET0L Languages Is Not Decidable.

[BibT_eX]

J. Inf. Process. Cybern., 1994

Valuations and Unambiguity of Languages, with Applications to Fractal Geometry.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1993

Adult Languages of Propagating Systems with Restricted Parallelism.

[BibT_eX]

J. Inf. Process. Cybern., 1993

Remarks on Adult Languages of Propagating Systems with Restricted Parallelism.

[BibT_eX]

Proceedings of the Developments in Language Theory, 1993

1991

On Function-limited Lindenmayer Systems.

[BibT_eX]