Minimal strings in a regular language with respect to a partial order on the alphabet

DOI10.1016/0304-3975(91)90280-FzbMath0729.68037OpenAlexW2037957156WikidataQ127190792 ScholiaQ127190792MaRDI QIDQ807021

Sukhamay Kundu

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

zbMATH Keywords

regular languagepartial orderfinite state machineminimal string problemminimum-state machine

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Partial orders on words, minimal elements of regular languages, and state complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimal strings in a regular language with respect to a partial order on the alphabet