Pattern languages with and without erasing
From MaRDI portal
Publication:4839719
DOI10.1080/00207169408804252zbMath0939.68690MaRDI QIDQ4839719
Tao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu, E. B. Kinber
Publication date: 4 July 2000
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169408804252
68Q45: Formal languages and automata
Related Items
Finite degrees of ambiguity in pattern languages, Pattern systems, Multi-pattern languages, 2-testability and relabelings produce everything, A note on the equivalence problem of \(E\)-patterns, On the equivalence problem for E-pattern languages
Cites Work