Multi-pattern languages
From MaRDI portal
Publication:673787
DOI10.1016/0304-3975(94)00087-YzbMath0873.68112OpenAlexW1963501278MaRDI QIDQ673787
Arto Salomaa, Lila Kari, Gheorghe Păun, Alexandru Mateescu
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
Related Items (8)
Remarks on arbitrary multiple pattern interpretations ⋮ On the undecidability and descriptional complexity of synchronized regular expressions ⋮ Pattern systems ⋮ Extending regular expressions with homomorphic replacement ⋮ Restricted ambiguity of erasing morphisms ⋮ Learning in the limit with lattice-structured hypothesis spaces ⋮ On Extended Regular Expressions ⋮ On the closure of pattern expressions languages under intersection with regular languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Undecidability of ground reducibility for word rewriting systems with variables
- Avoidable patterns in strings of symbols
- Finding patterns common to a set of strings
- Languages with homomorphic replacements
- GRAMMARS BASED ON PATTERNS
- Pattern languages with and without erasing
- Simple matrix languages
This page was built for publication: Multi-pattern languages
