Another generalization of Higman's well quasi order result on ^*
From MaRDI portal
Publication:1069312
DOI10.1016/0012-365X(85)90176-1zbMATH Open0583.68039OpenAlexW2078146321MaRDI QIDQ1069312FDOQ1069312
Authors: David Haussler 
Publication date: 1985
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(85)90176-1
Recommendations
Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Cites Work
- The theory of well-quasi-ordering: a frequently discovered concept
- Title not available (Why is that?)
- Ordering by Divisibility in Abstract Algebras
- Software Descriptions with Flow Expressions
- On the complexity of iterated shuffle
- The power of synchronizing operations on strings
- On regularity of context-free languages
Cited In (11)
- Well quasi-orders, unavoidable sets, and derivation systems
- \(\Sigma_1\)-wellorders without collapsing
- Galvin's question on non-\( \sigma \)-well ordered linear orders
- Well Quasi-orders in Formal Language Theory
- Well-quasi-ordering and the Hausdorff quasi-uniformity
- Termination of rewriting
- Well quasi-orders and context-free grammars
- Well quasi-orders generated by a word-shuffle rewriting
- Developments in Language Theory
- Well Quasi Orders and the Shuffle Closure of Finite Sets
- Une généralisation des théorèmes de Higman et de Simon aux mots infinis
This page was built for publication: Another generalization of Higman's well quasi order result on \(\Sigma ^*\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1069312)
