Binary right-distinguishability operation

DOI10.1007/978-3-031-97274-4_2MaRDI QIDQ6877493zbMATH OpenFDO

Authors C. Câmpeanu

Publication date 8 January 2026

Full work available at URL https://doi.org/10.1007/978-3-031-97274-4_2

zbMATH Keywords

distinguishabilityequivalence relationregular languages

Mathematics Subject Classification ID

Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Cites work

• Binary distinguishability operation
• Distinguishability operations and closures
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• In search of most complex regular languages
• On the state complexity of reversals of regular languages
• On the state complexity of scattered substrings and superstrings
• Sur l'opération A de l'analysis situs.
• Theory of átomata

Cited in

(1)

• State complexity of side and rim operations

This page was built for publication: Binary right-distinguishability operation

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