Separating words with machines and groups

DOI10.1051/ITA/1996300100811zbMATH Open0851.68076OpenAlexW126461933MaRDI QIDQ4889817FDOQ4889817

Authors: John Michael Robson 

Publication date: 17 November 1996

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92526

Recommendations

• Separating strings with small automata
• Remarks on separating words
• Identical relations in symmetric groups and separating words with reversible automata
• Lower bounds on words separation: are there short identities in transformation semigroups?
• Words separation and positive identities in symmetric groups

zbMATH Keywords

finite state machine

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Separating strings with small automata

Cited In (6)

• Words separation and positive identities in symmetric groups
• Identical relations in symmetric groups and separating words with reversible automata
• Separating words problem over groups
• Lower bounds on words separation: are there short identities in transformation semigroups?
• On the gap between separating words and separating their reversals
• Remarks on separating words

This page was built for publication: Separating words with machines and groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4889817)