Multi-pattern languages
From MaRDI portal
Publication:673787
DOI10.1016/0304-3975(94)00087-YzbMATH Open0873.68112OpenAlexW1963501278MaRDI QIDQ673787FDOQ673787
Authors: Lila Kari, Alexandru Mateescu, Gheorghe Păun, Arto Salomaa 
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00087-y
Recommendations
Cites Work
- Avoidable patterns in strings of symbols
- Finding patterns common to a set of strings
- Pattern languages with and without erasing
- Languages with homomorphic replacements
- Title not available (Why is that?)
- Simple matrix languages
- Title not available (Why is that?)
- GRAMMARS BASED ON PATTERNS
- Title not available (Why is that?)
- Undecidability of ground reducibility for word rewriting systems with variables
Cited In (13)
- An aperiodicity problem for multiwords
- Remarks on arbitrary multiple pattern interpretations
- Learning in the limit with lattice-structured hypothesis spaces
- Restricted ambiguity of erasing morphisms
- Multiple pattern interpretations
- On the closure of pattern expressions languages under intersection with regular languages
- Extending regular expressions with homomorphic replacement
- On Extended Regular Expressions
- Closure properties of pattern languages
- Pattern language recognition and generation
- Title not available (Why is that?)
- On the undecidability and descriptional complexity of synchronized regular expressions
- Pattern systems
This page was built for publication: Multi-pattern languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673787)
