Frank Drewes

From MaRDI portal
Person:493118

Available identifiers

zbMath Open drewes.frankMaRDI QIDQ493118

List of research outcomes

PublicationDate of PublicationType
Hybrid tree automata and the yield theorem for constituent tree automata2023-10-26Paper
Incremental termination proofs and the length of derivations2022-12-09Paper
Criteria to disprove context-freeness of collage languages2022-12-09Paper
Hyperedge replacement with rendezvous2022-11-02Paper
Graph Parsing as Graph Transformation2022-09-01Paper
Hybrid tree automata and the yield theorem for constituent tree automata2022-08-16Paper
https://portal.mardi4nfdi.de/entity/Q50948842022-08-04Paper
Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars2022-03-21Paper
https://portal.mardi4nfdi.de/entity/Q49949382021-06-22Paper
Bottom-up unranked tree-to-graph transducers for translation into semantic graphs2021-06-03Paper
Uniform parsing for hyperedge replacement grammars2021-03-10Paper
https://portal.mardi4nfdi.de/entity/Q49647012021-03-03Paper
Z-automata for compact and direct representation of unranked tree languages2020-05-06Paper
Extending predictive shift-reduce parsing to contextual hyperedge replacement grammars2020-02-06Paper
The metric dimension of \(\mathbb{Z}_n \times \mathbb{Z}_n \times \mathbb{Z}_n\) is \(\lfloor 3n/2 \rfloor \)2020-01-16Paper
Predictive Shift-Reduce Parsing for Hyperedge Replacement Grammars2019-11-22Paper
Language theoretic properties of regular DAG languages2019-09-17Paper
https://portal.mardi4nfdi.de/entity/Q49672292019-07-03Paper
Efficient enumeration of weighted tree languages over the tropical semiring2019-06-25Paper
Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement2019-06-20Paper
The use of tree transducers to compute translations between graph algebras2019-01-10Paper
An optimal strategy for static black-peg mastermind with three pegs2018-11-08Paper
A comparison of two \(N\)-best extraction methods for weighted tree automata2018-11-07Paper
The Output Size Problem for String-to-Tree Transducers2018-09-17Paper
Tight Bounds for Cut-Operations on Deterministic Finite Automata*2018-01-19Paper
https://portal.mardi4nfdi.de/entity/Q45991772017-12-18Paper
https://portal.mardi4nfdi.de/entity/Q45992182017-12-18Paper
Finding the \(N\) best vertices in an infinite weighted hypergraph2017-06-15Paper
Context-Free Tree Grammars are as Powerful as Context-Free Jungle Grammars2016-05-03Paper
Properties of Regular DAG Languages2016-04-13Paper
Between a Rock and a Hard Place – Uniform Parsing for Hyperedge Replacement DAG Grammars2016-04-13Paper
An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring2016-04-08Paper
The generative power of delegation networks2015-12-07Paper
Predictive Top-Down Parsing for Hyperedge Replacement Grammars2015-09-22Paper
Tight Bounds for Cut-Operations on Deterministic Finite Automata2015-09-15Paper
Contextual hyperedge replacement2015-09-11Paper
Graph transformation for incremental natural language analysis2014-03-28Paper
Cuts in Regular Expressions2013-06-28Paper
MAT learners for tree series: an abstract data type and two realizations2012-03-23Paper
Selected Decision Problems for Square-Refinement Collage Grammars2011-11-11Paper
https://portal.mardi4nfdi.de/entity/Q30771842011-02-22Paper
Algorithmic Properties of Millstream Systems2010-08-31Paper
Adaptive star grammars and their languages2010-08-11Paper
LINKS2010-01-29Paper
Bag Context Tree Grammars2009-03-26Paper
https://portal.mardi4nfdi.de/entity/Q36018492009-02-12Paper
Adaptive Star Grammars2008-11-27Paper
Adaptive Star Grammars for Graph Models2008-11-20Paper
From Tree-Based Generators to Delegation Networks2008-09-04Paper
An Algebra for Tree-Based Music Generation2008-09-04Paper
https://portal.mardi4nfdi.de/entity/Q35172562008-08-12Paper
https://portal.mardi4nfdi.de/entity/Q54501102008-03-19Paper
Query learning of regular tree languages: How to avoid dead states2007-02-14Paper
https://portal.mardi4nfdi.de/entity/Q54859812006-09-06Paper
Grammatical picture generation. A tree-based approach. With CD-ROM.2005-05-26Paper
https://portal.mardi4nfdi.de/entity/Q48198852004-10-05Paper
https://portal.mardi4nfdi.de/entity/Q48207902004-10-01Paper
Branching synchronization grammars with nested tables2004-08-10Paper
https://portal.mardi4nfdi.de/entity/Q44520682004-02-11Paper
https://portal.mardi4nfdi.de/entity/Q44520692004-02-11Paper
https://portal.mardi4nfdi.de/entity/Q44313462003-10-21Paper
Criteria to disprove context freeness of collage languages.2003-08-17Paper
The complexity of the exponential output size problem for top-down and bottom-up tree transducers2003-01-14Paper
https://portal.mardi4nfdi.de/entity/Q47821122002-11-27Paper
Decidability of the finiteness of ranges of tree transductions2002-11-24Paper
https://portal.mardi4nfdi.de/entity/Q27089762002-11-04Paper
Hierarchical graph transformation2002-08-04Paper
https://portal.mardi4nfdi.de/entity/Q45409612002-07-28Paper
https://portal.mardi4nfdi.de/entity/Q45409802002-07-28Paper
Tree-based generation of languages of fractals2002-03-03Paper
https://portal.mardi4nfdi.de/entity/Q27538552001-11-11Paper
https://portal.mardi4nfdi.de/entity/Q45028012001-04-19Paper
Tree-based picture generation2000-10-26Paper
https://portal.mardi4nfdi.de/entity/Q45082962000-10-03Paper
https://portal.mardi4nfdi.de/entity/Q49544442000-06-07Paper
https://portal.mardi4nfdi.de/entity/Q49343322000-01-17Paper
https://portal.mardi4nfdi.de/entity/Q46992991999-11-10Paper
A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars1999-03-22Paper
https://portal.mardi4nfdi.de/entity/Q42227931998-12-13Paper
Language theoretic and algorithmic properties of \(d\)-dimensional collages and patterns in a grid1997-03-31Paper
Generating self-affine fractals by collage grammars1997-02-28Paper
https://portal.mardi4nfdi.de/entity/Q48907111996-08-25Paper
https://portal.mardi4nfdi.de/entity/Q48746581996-08-13Paper
Recognising \(k\)-connected hypergraphs in cubic time1994-01-19Paper
https://portal.mardi4nfdi.de/entity/Q40372911993-05-18Paper
NP-completeness of \(k\)-connected hyperedge-replacement languages of order \(k\)1993-05-16Paper
Some modifications of auxiliary pushdown automata1991-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Frank Drewes