@inproceedings{DBLP:conf/dcfs/FernauFOR05,
  author    = {Henning Fernau and
               Rudolf Freund and
               Marion Oswald and
               Klaus Reinhardt},
  title     = {Refining the Nonterminal Complexity of Graph-controlled Grammars},
  booktitle = {7th International Workshop on Descriptional Complexity of Formal Systems
               - {DCFS} 2005, Como, Italy, June 30 - July 2, 2005. Proceedings},
  pages     = {110--121},
  year      = {2005},
  crossref  = {DBLP:conf/dcfs/2005},
  timestamp = {Fri, 21 Oct 2011 15:06:32 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/dcfs/FernauFOR05},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"WY4JBpdzk6Sd8eLxq","bibbaseid":"fernau-freund-oswald-reinhardt-refiningthenonterminalcomplexityofgraphcontrolledgrammars-2005","downloads":0,"creationDate":"2018-10-01T13:54:48.890Z","title":"Refining the Nonterminal Complexity of Graph-controlled Grammars","author_short":["Fernau, H.","Freund, R.","Oswald, M.","Reinhardt, K."],"year":2005,"bibtype":"inproceedings","biburl":"https://dblp.org/pid/f/HenningFernau.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Henning"],"propositions":[],"lastnames":["Fernau"],"suffixes":[]},{"firstnames":["Rudolf"],"propositions":[],"lastnames":["Freund"],"suffixes":[]},{"firstnames":["Marion"],"propositions":[],"lastnames":["Oswald"],"suffixes":[]},{"firstnames":["Klaus"],"propositions":[],"lastnames":["Reinhardt"],"suffixes":[]}],"title":"Refining the Nonterminal Complexity of Graph-controlled Grammars","booktitle":"7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30 - July 2, 2005. Proceedings","pages":"110–121","year":"2005","crossref":"DBLP:conf/dcfs/2005","timestamp":"Fri, 21 Oct 2011 15:06:32 +0200","biburl":"https://dblp.org/rec/bib/conf/dcfs/FernauFOR05","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/dcfs/FernauFOR05,\n author = {Henning Fernau and\n Rudolf Freund and\n Marion Oswald and\n Klaus Reinhardt},\n title = {Refining the Nonterminal Complexity of Graph-controlled Grammars},\n booktitle = {7th International Workshop on Descriptional Complexity of Formal Systems\n - {DCFS} 2005, Como, Italy, June 30 - July 2, 2005. Proceedings},\n pages = {110--121},\n year = {2005},\n crossref = {DBLP:conf/dcfs/2005},\n timestamp = {Fri, 21 Oct 2011 15:06:32 +0200},\n biburl = {https://dblp.org/rec/bib/conf/dcfs/FernauFOR05},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Fernau, H.","Freund, R.","Oswald, M.","Reinhardt, K."],"key":"DBLP:conf/dcfs/FernauFOR05","id":"DBLP:conf/dcfs/FernauFOR05","bibbaseid":"fernau-freund-oswald-reinhardt-refiningthenonterminalcomplexityofgraphcontrolledgrammars-2005","role":"author","urls":{},"downloads":0},"search_terms":["refining","nonterminal","complexity","graph","controlled","grammars","fernau","freund","oswald","reinhardt"],"keywords":[],"authorIDs":[],"dataSources":["TuA7fGR5JYLK4NXQn"]}