Finite degrees of ambiguity in pattern languages
RAIRO-Theor. Inf. Appl., 28 3-4 (1994) 233-253
Published online: 2017-02-03
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Pattern Matching with Variables
Henning Fernau, Florin Manea, Robert Mercaş and Markus L. SchmidACM Transactions on Computation Theory 12 (1) 1 (2020)
https://doi.org/10.1145/3369935
11682 1 (2019)
https://doi.org/10.1007/978-3-030-28796-2_1
Developments in Language Theory
Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka and Markus L. SchmidLecture Notes in Computer Science, Developments in Language Theory 11088 269 (2018)
https://doi.org/10.1007/978-3-319-98654-8_22
A Parameterized Study of Maximum Generalized Pattern Matching Problems
Sebastian Ordyniak and Alexandru PopaAlgorithmica 75 (1) 1 (2016)
https://doi.org/10.1007/s00453-015-0008-8
On the Parameterised Complexity of String Morphism Problems
Henning Fernau, Markus L. Schmid and Yngve VillangerTheory of Computing Systems 59 (1) 24 (2016)
https://doi.org/10.1007/s00224-015-9635-3
Pattern matching with variables: A multivariate complexity analysis
Henning Fernau and Markus L. SchmidInformation and Computation 242 287 (2015)
https://doi.org/10.1016/j.ic.2015.03.006
Parameterized and Exact Computation
Sebastian Ordyniak and Alexandru PopaLecture Notes in Computer Science, Parameterized and Exact Computation 8894 270 (2014)
https://doi.org/10.1007/978-3-319-13524-3_23
Regular and context-free pattern languages over small alphabets
Daniel Reidenbach and Markus L. SchmidTheoretical Computer Science 518 80 (2014)
https://doi.org/10.1016/j.tcs.2013.07.035
Combinatorial Pattern Matching
Henning Fernau and Markus L. SchmidLecture Notes in Computer Science, Combinatorial Pattern Matching 7922 83 (2013)
https://doi.org/10.1007/978-3-642-38905-4_10
Developments in Language Theory
Daniel Reidenbach and Markus L. SchmidLecture Notes in Computer Science, Developments in Language Theory 7410 130 (2012)
https://doi.org/10.1007/978-3-642-31653-1_13
Bad news on decision problems for patterns
Dominik D. Freydenberger and Daniel ReidenbachInformation and Computation 208 (1) 83 (2010)
https://doi.org/10.1016/j.ic.2009.04.002
Developments in Language Theory
Dominik D. Freydenberger and Daniel ReidenbachLecture Notes in Computer Science, Developments in Language Theory 5257 327 (2008)
https://doi.org/10.1007/978-3-540-85780-8_26
Discontinuities in pattern inference
Daniel ReidenbachTheoretical Computer Science 397 (1-3) 166 (2008)
https://doi.org/10.1016/j.tcs.2008.02.029
A non-learnable class of E-pattern languages
Daniel ReidenbachTheoretical Computer Science 350 (1) 91 (2006)
https://doi.org/10.1016/j.tcs.2005.10.017
UNAMBIGUOUS MORPHIC IMAGES OF STRINGS
DOMINIK D. FREYDENBERGER, DANIEL REIDENBACH and JOHANNES C. SCHNEIDERInternational Journal of Foundations of Computer Science 17 (03) 601 (2006)
https://doi.org/10.1142/S0129054106004017
Developments in Language Theory
Dominik D. Freydenberger, Daniel Reidenbach and Johannes C. SchneiderLecture Notes in Computer Science, Developments in Language Theory 3572 248 (2005)
https://doi.org/10.1007/11505877_22
Learning Theory
Daniel ReidenbachLecture Notes in Computer Science, Learning Theory 3120 140 (2004)
https://doi.org/10.1007/978-3-540-27819-1_10
Formal Languages and Applications
Kai SalomaaStudies in Fuzziness and Soft Computing, Formal Languages and Applications 148 367 (2004)
https://doi.org/10.1007/978-3-540-39886-8_18
Developments in Language Theory
Daniel ReidenbachLecture Notes in Computer Science, Developments in Language Theory 3340 368 (2004)
https://doi.org/10.1007/978-3-540-30550-7_31
STACS 2004
Daniel ReidenbachLecture Notes in Computer Science, STACS 2004 2996 129 (2004)
https://doi.org/10.1007/978-3-540-24749-4_12
Handbook of Formal Languages
Alexandru Mateescu and Arto SalomaaHandbook of Formal Languages 175 (1997)
https://doi.org/10.1007/978-3-642-59136-5_4