Dr. Nils Erik Flick
Kontakt
- Leitung
Prof. Dr. Annegret Habel - Sekretariat
Marion Bramkamp
Tel.: +49-(0)441-798-2426
Fax.: +49-(0)441-798-2965
Raum: A3 2-208

Dr. Nils Erik Flick
Anschrift: | Dr. Nils Erik Flick Universität Oldenburg Fakultät II Department für Informatik 26111 Oldenburg |
E-Mail: | flick |
-
[article] bibtexN. E. Flick und B. Engelmann, "Analysis of Petri Nets with context-free structure changes," Electronic Communications of the EASST, vol. 71, 2015.
@article{Flick-Engelmann15a,
author = {Flick, Nils Erik and Engelmann, Bj{\"o}rn},
title = {Analysis of Petri Nets with context-free structure changes},
booktitle = {Graph Computation Models 2014},
journal = {Electronic Communications of the EASST},
volume = {71},
year = {2015} } -
[inproceedings] bibtex |
Dokument aufrufen
N. E. Flick, "On Correctness of Graph Programs Relative to Recursively Nested Conditions," in Proc. Graph Computation Models (GCM 2015), 2015, pp. 97-112.@inproceedings{Flick15a,
author = {Nils Erik Flick},
title = {On Correctness of Graph Programs Relative to Recursively Nested Conditions},
booktitle = {Graph Computation Models (GCM 2015)},
publisher = {CEUR-WS.org},
volume = {1403},
pages = {97--112},
year = {2015},
url = {http://ceur-ws.org/Vol-1403} } -
[article] bibtexN. E. Flick, "Derivation Languages of Graph Grammars," Electronic Communications of the EASST, vol. 61, 2013.
@article{Flick13a,
author = {Flick, Nils Erik},
title = {Derivation Languages of Graph Grammars},
booktitle = {Graph Computation Models 2012},
journal = {Electronic Communications of the EASST},
volume = {61},
year = {2013} } -
[inproceedings] bibtexN. E. Flick und M. Kudlek, "A Hierarchy of Languages with Catenation and Shuffle," in Proc. Concurrency, Specification and Programming (CS&P), 2012, pp. 103-114.
@inproceedings{Flick-Kudlek12c,
author = {Nils Erik Flick AND Manfred Kudlek},
title = {A Hierarchy of Languages with Catenation and Shuffle},
booktitle = {Concurrency, Specification and Programming (CS{\&}P)},
year = {2012},
pages = {103-114} } -
[inproceedings] bibtexN. E. Flick und M. Kudlek, "Language Operators for Multiset Languages and Modal Logic," in Proc. Non-Classical Models for Automata and Applications (NCMA), 2012, pp. 79-91.
@inproceedings{Flick-Kudlek12a,
author = {Nils Erik Flick AND Manfred Kudlek},
title = {Language Operators for Multiset Languages and Modal Logic},
booktitle = {Non-Classical Models for Automata and Applications (NCMA)},
year = {2012},
pages = {79-91} } -
[inproceedings] bibtexN. E. Flick und M. Kudlek, "On a Hierarchy of Languages with Catenation and Shuffle," in Proc. Developments in Language Theory, 2012, pp. 452-458.
@inproceedings{Flick-Kudlek12b,
author = {Nils Erik Flick and Manfred Kudlek},
title = {On a Hierarchy of Languages with Catenation and Shuffle},
booktitle = {Developments in Language Theory},
year = {2012},
pages = {452-458} } -
[inproceedings] bibtexN. E. Flick und M. Kudlek, "Properties of Languages with Catenation and Shuffle," in Proc. Concurrency, Specification and Programming (CS&P), 2012, pp. 91-102.
@inproceedings{Flick-Kudlek-12d,
author = {Nils Erik Flick AND Manfred Kudlek},
title = {Properties of Languages with Catenation and Shuffle},
booktitle = {Concurrency, Specification and Programming (CS{\&}P)},
year = {2012},
pages = {91-102} } -
[inproceedings] bibtexN. E. Flick, "Quotients of Unbounded Parallelism," in Proc. ICTAC 2015, 2015, pp. 241-257.
@inproceedings{flick15b,
author = {Flick, Nils Erik},
title = {Quotients of Unbounded Parallelism},
booktitle = {ICTAC 2015},
series = {Lecture Notes in Computer Science},
volume = {9399},
pages = {241--257},
year = {2015},
isbn = {978-3-319-25150-9} } -
[article] bibtexN. E. Flick, "Correctness of Graph Programs Relative to Recursively Nested Conditions," Electronic Communications of the EASST, vol. 73, 2016.
@article{flick16a, title = {Correctness of Graph Programs Relative to Recursively Nested Conditions},
author = {Flick, Nils Erik},
journal = {Electronic Communications of the EASST},
booktitle = {Selected Revised Papers from the Workshop on Graph Computation Models (GCM 2015)},
volume = {73},
year = {2016},
ee = {http://journal.ub.tu-berlin.de/eceasst/article/view/1037/1025} }