2-testability and relabelings produce everything

DOI10.1006/jcss.1997.1548zbMath0936.68060OpenAlexW2016772775MaRDI QIDQ1271607

Lucian Ilie, Arto Salomaa

Publication date: 18 May 2000

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/423f2d60ed8d79c1d0abac1a34e1732d46dd872a

zbMATH Keywords

rewriting systemsgrammar systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

Computing with membranes

Cites Work

• Finding patterns common to a set of strings
• A Purely Homomorphic Characterization of Recursively Enumerable Sets
• Pattern languages with and without erasing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: 2-testability and relabelings produce everything