Starten Sie Ihre Suche...


Durch die Nutzung unserer Webseite erklären Sie sich damit einverstanden, dass wir Cookies verwenden. Weitere Informationen

Univ.-Prof. Dr. Henning Fernau

Informatikwissenschaften, Universität Trier

Publikationen
Ergebnisse pro Seite:  10

Fernau, Henning; Kuppusamy, Lakshmanan; O. Oladele, Rufus et al.

Minimizing Rules and Nonterminals in Semi-conditional Grammars: Non-trivial for the Simple Case.

MCU. 2018 S. 88 - 104


Fernau, Henning; Kuppusamy, Lakshmanan; O. Oladele, Rufus

New Nonterminal Complexity Results for Semi-conditional Grammars.

CiE. 2018 S. 172 - 182


Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi

On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems.

RAIRO - Theor. Inf. and Applic. Bd. 52. H. 1. 2018 S. 1 - 21


Fernau, Henning; A. Rodríguez-Velázquez, Juan

On the (adjacency) metric dimension of corona and strong product graphs and their local variants: Combinatorial and computational results.

Discrete Applied Mathematics. Bd. 236. 2018 S. 183 - 202


Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi

Properties of Language Classes Between Linear and Context-Free.

Journal of Automata, Languages and Combinatorics. Bd. 23. H. 4. 2018 S. 329 - 360


Fernau, Henning; Manea, Florin; Mercas, Robert et al.

Revisiting Shinohara's algorithm for computing descriptive patterns.

Theor. Comput. Sci. Bd. 733. 2018 S. 44 - 54


Fernau, Henning; Paramasivan, Meenakshi; L. Schmid, Markus et al.

Simple picture processing based on finite automata and regular grammars.

J. Comput. Syst. Sci. Bd. 95. 2018 S. 232 - 258


N. Abu-Khzam, Faisal; Fernau, Henning; Uehara, Ryuhei

Special Issue on Reconfiguration Problems.

Algorithms. Bd. 11. H. 11. 2018 S. 187


Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin et al.

The many facets of upper domination.

Theor. Comput. Sci. Bd. 717. 2018 S. 2 - 25


Fernau, Henning; Paramasivan, Meenakshi; L. Schmid, Markus et al.

Characterization and complexity results on jumping finite automata.

Theor. Comput. Sci. Bd. 679. 2017 S. 31 - 52