A note on inferring uniquely terminating code languages

DOI10.1016/S0020-0190(99)00065-4zbMath1002.68081MaRDI QIDQ1606942

J. D. Emerald, K. G. Subramanian, D. Gnanaraj Thomas

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

equal matrix languagesuniquely terminating code linear languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Inferring uniquely terminating regular languages from positive data

This page was built for publication: A note on inferring uniquely terminating code languages