Minimal strings in a regular language with respect to a partial order on the alphabet
From MaRDI portal
Publication:807021
DOI10.1016/0304-3975(91)90280-FzbMath0729.68037OpenAlexW2037957156WikidataQ127190792 ScholiaQ127190792MaRDI QIDQ807021
Publication date: 1991
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(91)90280-f
Related Items (1)
Cites Work
This page was built for publication: Minimal strings in a regular language with respect to a partial order on the alphabet