On well quasi orders of free monoids
From MaRDI portal
Publication:1275465
DOI10.1016/S0304-3975(98)00036-XzbMATH Open0913.68114MaRDI QIDQ1275465FDOQ1275465
Authors: Lucian Ilie, Arto Salomaa 
Publication date: 12 January 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The theory of well-quasi-ordering: a frequently discovered concept
- Ordering by Divisibility in Abstract Algebras
- On free monoids partially ordered by embedding
- Title not available (Why is that?)
- Effective constructions in well-partially-ordered free monoids
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Title not available (Why is that?)
- A note on decidability questions on presentations of word semigroups
- On quasi orders of words and the confluence property
- Title not available (Why is that?)
- On a question of Eggan
Cited In (10)
- Well quasi-orders, unavoidable sets, and derivation systems
- Well Quasi-orders in Formal Language Theory
- Well quasi-orders and regular languages
- Title not available (Why is that?)
- On classes of regular languages related to monotone WQOs
- Stable quasiorderings on some permutable inverse monoids.
- Well quasi-orders and context-free grammars
- Well quasi-orders generated by a word-shuffle rewriting
- Quasimorphismes sur le monoïde libre, et substitutions dans les mesures invariantes
- WQO is decidable for factorial languages
This page was built for publication: On well quasi orders of free monoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1275465)
