Partial orders on words, minimal elements of regular languages, and state complexity
- 25 October 1993
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 119 (2) , 267-291
- https://doi.org/10.1016/0304-3975(93)90160-u
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- State-complexity of finite-state devices, state compressibility and incompressibilityTheory of Computing Systems, 1993
- Minimal strings in a regular language with respect to a partial order on the alphabetTheoretical Computer Science, 1991
- Succinct representation of regular languages by boolean automataTheoretical Computer Science, 1981
- AlternationJournal of the ACM, 1981
- The theory of well-quasi-ordering: A frequently discovered conceptJournal of Combinatorial Theory, Series A, 1972
- Ordering by Divisibility in Abstract AlgebrasProceedings of the London Mathematical Society, 1952