Federico Mora, Ankush Desai, Elizabeth Polgreen & Sanjit A. Seshia. (2023) Message Chains for Distributed System Verification. Proceedings of the ACM on Programming Languages 7:OOPSLA2, pages 2224-2250.
Crossref
Fahimeh Bayeh, Ziyuan Gao & Sandra Zilles. (2020) Finitely distinguishable erasing pattern languages. Theoretical Computer Science 808, pages 38-73.
Crossref
Fernando Arroyo, Victor Mitrana, Andrei Păun & Mihaela Păun. 2020. Agents and Multi-agent Systems: Technologies and Applications 2019. Agents and Multi-agent Systems: Technologies and Applications 2019
95
104
.
Ziyuan Gao. 2019. Developments in Language Theory. Developments in Language Theory
154
167
.
Dominik D. Freydenberger & Mario Holldack. (2017) Document Spanners: From Expressive Power to Decision Problems. Theory of Computing Systems 62:4, pages 854-898.
Crossref
Joel D. Day, Daniel Reidenbach & Markus L. Schmid. (2017) Closure properties of pattern languages. Journal of Computer and System Sciences 84, pages 11-31.
Crossref
Henning Fernau, Markus L. Schmid & Yngve Villanger. (2015) On the Parameterised Complexity of String Morphism Problems. Theory of Computing Systems 59:1, pages 24-51.
Crossref
Sebastian Ordyniak & Alexandru Popa. (2015) A Parameterized Study of Maximum Generalized Pattern Matching Problems. Algorithmica 75:1, pages 1-26.
Crossref
Henning Fernau & Markus L. Schmid. (2015) Pattern matching with variables: A multivariate complexity analysis. Information and Computation 242, pages 287-305.
Crossref
Daniel Reidenbach & Markus L. Schmid. (2014) Regular and context-free pattern languages over small alphabets. Theoretical Computer Science 518, pages 80-95.
Crossref
Sebastian Ordyniak & Alexandru Popa. 2014. Parameterized and Exact Computation. Parameterized and Exact Computation
270
281
.
Dominik D. Freydenberger & Daniel Reidenbach. (2013) Inferring descriptive generalisations of formal languages. Journal of Computer and System Sciences 79:5, pages 622-639.
Crossref
Henning Fernau & Markus L. Schmid. 2013. Combinatorial Pattern Matching. Combinatorial Pattern Matching
83
94
.
Joachim Bremer & Dominik D. Freydenberger. (2012) Inclusion problems for patterns with a bounded number of variables. Information and Computation 220-221, pages 15-43.
Crossref
Daniel Reidenbach & Markus L. Schmid. 2012. Developments in Language Theory. Developments in Language Theory
130
141
.
Daniel Reidenbach & Johannes C. Schneider. (2011) Restricted ambiguity of erasing morphisms. Theoretical Computer Science 412:29, pages 3510-3523.
Crossref
Michael Geilke & Sandra Zilles. 2011. Algorithmic Learning Theory. Algorithmic Learning Theory
84
98
.
Daniel Reidenbach & Markus L. Schmid. 2011. Implementation and Application of Automata. Implementation and Application of Automata
241
250
.
Dominik D. Freydenberger & Daniel Reidenbach. (2010) Existence and nonexistence of descriptive patterns. Theoretical Computer Science 411:34-36, pages 3274-3286.
Crossref
Dominik D. Freydenberger & Daniel Reidenbach. (2010) Bad news on decision problems for patterns. Information and Computation 208:1, pages 83-96.
Crossref
Daniel Reidenbach & Johannes C. Schneider. 2010. Developments in Language Theory. Developments in Language Theory
387
398
.
Joachim Bremer & Dominik D. Freydenberger. 2010. Developments in Language Theory. Developments in Language Theory
100
111
.
Dominik D. Freydenberger & Daniel Reidenbach. 2009. Developments in Language Theory. Developments in Language Theory
228
239
.
Daniel Reidenbach. (2008) Discontinuities in pattern inference. Theoretical Computer Science 397:1-3, pages 166-193.
Crossref
Dominik D. Freydenberger & Daniel Reidenbach. 2008. Developments in Language Theory. Developments in Language Theory
327
338
.
Carlos Martín-Vide & Victor Mitrana. (2007) Remarks on arbitrary multiple pattern interpretations. Information Processing Letters 101:5, pages 209-214.
Crossref
Daniel Reidenbach. (2006) A non-learnable class of E-pattern languages. Theoretical Computer Science 350:1, pages 91-102.
Crossref
Yen Kaow Ng & Takeshi Shinohara. 2005. Algorithmic Learning Theory. Algorithmic Learning Theory
269
282
.
Kai Salomaa. 2004. Formal Languages and Applications. Formal Languages and Applications
367
379
.
Daniel Reidenbach. 2005. Developments in Language Theory. Developments in Language Theory
368
380
.
Daniel Reidenbach. 2004. Learning Theory. Learning Theory
140
154
.
Daniel Reidenbach. 2004. STACS 2004. STACS 2004
129
140
.
Daniel Reidenbach. 2002. Algorithmic Learning Theory. Algorithmic Learning Theory
308
320
.
Lucian Ilie & Arto Salomaa. (1998) 2-Testability and Relabelings Produce Everything. Journal of Computer and System Sciences 56:3, pages 253-262.
Crossref
Enno Ohlebusch & Esko Ukkonen. (1997) On the equivalence problem for E-pattern languages. Theoretical Computer Science 186:1-2, pages 231-248.
Crossref
Alexandru Mateescu & Arto Salomaa. 1997. Handbook of Formal Languages. Handbook of Formal Languages
175
251
.
Victor Mitrana, Gheorghe Păun, Grzegorz Rozenberg & Arto Salomaa. (1996) Pattern systems. Theoretical Computer Science 154:2, pages 183-201.
Crossref
G. Dányi & Z. Fülöp. (1996) A note on the equivalence problem of E-patterns. Information Processing Letters 57:3, pages 125-128.
Crossref
Enno Ohlebusch & Esko Ukkonen. 1996. Mathematical Foundations of Computer Science 1996. Mathematical Foundations of Computer Science 1996
457
468
.
Lila Kari, Alexandru Mateescu, Gheorghe Pǎun & Arto Salomaa. (1995) Multi-pattern languages. Theoretical Computer Science 141:1-2, pages 253-268.
Crossref