Properties of code events and homomorphisms over regular events

DOI10.1016/S0022-0000(76)80007-4zbMATH Open0355.94065MaRDI QIDQ1237764FDOQ1237764

K. Appert

Publication date: 1976

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Derivatives of Regular Expressions
• Characterizations of locally testable events
• On finite monoids having only trivial subgroups
• Roots of Star Events
• Locally testable languages
• Algebraic decision procedures for local testability
• On a question of McNaughton and Papert
• Free subsemigroups of a free semigroup
• A note on free subsemigroups with two generators

Cited In (4)

• The alphabetic complexity in homomorphic definitions of word, tree and picture languages
• Reducing the local alphabet size in tiling systems by means of 2D comma-free codes
• Title not available (Why is that?)
• On varieties of rational languages and variable-length codes

This page was built for publication: Properties of code events and homomorphisms over regular events

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