Selectors: a theory of formal languages, semimodular lattices, and branching and shelling processes
DOI10.1016/0001-8708(84)90042-2zbMath0583.68037OpenAlexW2013359116MaRDI QIDQ1069309
Publication date: 1984
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0001-8708(84)90042-2
distributive latticesformal languagesbranchingsemimodular latticesgreedoidsselectorshellingstepwise processes
Partial orders, general (06A06) Formal languages and automata (68Q45) Logical aspects of lattices and related structures (03G10) Semimodular lattices, geometric lattices (06C10) Total orders (06A05) Theory of operating systems (68N25) Algorithms in computer science (68W99)
Related Items (8)
Cites Work
- Structural properties of greedoids
- Extensions and duality of finite geometric closure operators
- The greedy algorithm for partially ordered sets
- Frink's theorem for modular lattices
- Meet-distributive lattices and the anti-exchange closure
- Über Morphismen halbmodularer Verbände
- The lattice of convex sets of an oriented matroid
- Geometries on partially ordered sets
- Evaluations over residuated structures
- The arithmetical theory of Birkhoff lattices
- A topology for semi-modular lattices
- Combinations of closure relations
- A Semimodular Imbedding of Lattices
- Projective Geometry on Partially Ordered Sets
- Ideals in Birkhoff Lattices
- A General Dependence Relation for Lattices
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Selectors: a theory of formal languages, semimodular lattices, and branching and shelling processes