Travelled to:
1 × Austria
1 × Finland
1 × Hungary
1 × Israel
1 × Sweden
2 × Greece
2 × Spain
4 × Germany
Collaborated with:
∅ L.Staiger R.Freund M.Holzer C.C.Florêncio J.Dassow R.Stiebe F.Stephan H.Bordihn M.Paramasivan M.L.Schmid J.Björklund A.Kasprzik P.Heggernes Y.Villanger J.Alber R.Niedermeier K.Reinhardt
Talks about:
grammar (6) system (5) languag (3) complex (3) parameter (2) distribut (2) automata (2) approach (2) problem (2) valuat (2)
Person: Henning Fernau
DBLP: Fernau:Henning
Facilitated 2 volumes:
Contributed to:
Wrote 16 papers:
- CIAA-2015-FernauPS #automaton #complexity #finite
- Jumping Finite Automata: Characterizations and Complexity (HF, MP, MLS), pp. 89–101.
- AFL-2014-FernauFH #distributed #finite #hybrid
- Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes (HF, RF, MH), pp. 246–260.
- LATA-2013-BjorklundFK #automaton #learning
- MAT Learning of Universal Automata (JB, HF, AK), pp. 141–152.
- LATA-2013-FernauHV #analysis #automaton #multi #problem
- A Multivariate Analysis of Some DFA Problems (HF, PH, YV), pp. 275–286.
- LATA-2010-FlorencioF #approach #bound #consistency
- Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach (CCF, HF), pp. 202–213.
- LATA-2007-DassowF #approach #comparison
- Comparison of Some Descriptional Complexities of 0L Systems Obtained by a Unifying Approach (JD, HF), pp. 249–260.
- DLT-2001-FernauS #algebra #perspective
- Valuated and Valence Grammars: An Algebraic View (HF, RS), pp. 281–292.
- ICALP-2001-AlberFN #complexity #exponential #graph #problem
- Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems (JA, HF, RN), pp. 261–272.
- MLDM-2001-Fernau #learning #xml
- Learning XML Grammars (HF), pp. 73–87.
- ICPR-v2-2000-Fernau #n-gram
- k-gram Extensions of Terminal Distinguishable Languages (HF), pp. 2125–2128.
- DLT-1999-FernauR #decidability
- Decidability of code properties (HF, KR, LS), pp. 153–163.
- DLT-1997-FernauHF #bound #distributed
- Bounding resources in Cooperating Distributed Grammar Systems (HF, MH, RF), pp. 261–272.
- DLT-1997-FernauS #how
- How Powerful is Unconditional Transfer? — When UT meets AC (HF, FS), pp. 249–260.
- DLT-1995-BordihnF #overview #perspective
- Accepting Grammars and Systems: An Overview (HB, HF), pp. 199–208.
- ICALP-1994-FernauS #ambiguity #geometry
- Valuations and Unambiguity of Languages, with Applications to Fractal Geometry (HF, LS), pp. 11–22.
- DLT-1993-Fernau #parallel #strict
- Remarks on Adult Languages of Propagating Systems with Restricted Parallelism (HF), pp. 90–101.