Characterizations for the regular prefix codes and related families

DOI10.1007/BF00978520zbMATH Open0453.68047OpenAlexW2046315594MaRDI QIDQ3901014FDOQ3901014

Authors: Paulo A. S. Veloso 

Publication date: 1980

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00978520

zbMATH Keywords

regular languagefinite automatonclosure propertiesregular expressionrecognizable right power-bounded languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)

Cites Work

• Title not available (Why is that?)
• Multiple-entry finite automata
• Left-noncounting languages
• Regular prefix codes and right power-bounded languages

This page was built for publication: Characterizations for the regular prefix codes and related families

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