Well quasi ordering finite posets and formal languages
From MaRDI portal
Publication:1898732
DOI10.1006/jctb.1995.1045zbMath0829.68076OpenAlexW2084949487MaRDI QIDQ1898732
Publication date: 15 January 1996
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1995.1045
Formal languages and automata (68Q45) Combinatorics of partially ordered sets (06A07) Discrete mathematics in relation to computer science (68R99) Distributed algorithms (68W15)
Related Items (3)
FPT Suspects and Tough Customers: Open Problems of Downey and Fellows ⋮ Chain minors are FPT ⋮ A new class of unique product monoids with applications to ring theory.
This page was built for publication: Well quasi ordering finite posets and formal languages
