Selectors: a theory of formal languages, semimodular lattices, and branching and shelling processes

DOI10.1016/0001-8708(84)90042-2zbMATH Open0583.68037OpenAlexW2013359116MaRDI QIDQ1069309FDOQ1069309

Authors: Henry Crapo 

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

Recommendations

• A note on selectors and greedoids
• Lattices of local two-dimensional languages
• Selection over classes of ordinals expanded by monadic predicates
• Selection in the monadic theory of a countable ordinal
• scientific article; zbMATH DE number 1202106

zbMATH Keywords

branchingdistributive latticesformal languagesselectorsemimodular latticesshellinggreedoidsstepwise processes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Partial orders, general (06A06) Total orders (06A05) Logical aspects of lattices and related structures (03G10) Algorithms in computer science (68W99) Theory of operating systems (68N25) Semimodular lattices, geometric lattices (06C10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Semimodular Imbedding of Lattices
• Meet-distributive lattices and the anti-exchange closure
• The greedy algorithm for partially ordered sets
• Geometries on partially ordered sets
• Projective Geometry on Partially Ordered Sets
• Structural properties of greedoids
• The arithmetical theory of Birkhoff lattices
• Combinations of closure relations
• Title not available (Why is that?)
• The lattice of convex sets of an oriented matroid
• Ideals in Birkhoff Lattices
• A General Dependence Relation for Lattices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Extensions and duality of finite geometric closure operators
• Frink's theorem for modular lattices
• Über Morphismen halbmodularer Verbände
• Evaluations over residuated structures
• A topology for semi-modular lattices

Cited In (8)

• Chip-firing games on graphs
• Branchings in rooted graphs and the diameter of greedoids
• Exchange properties of combinatorial closure spaces
• Homotopy properties of greedoids
• Greedoids and searches in directed graphs
• A note on selectors and greedoids
• Weakly submodular rank functions, supermatroids, and the flat lattice of a distributive super\-matroid
• Non-interval greedoids and the transposition property

This page was built for publication: Selectors: a theory of formal languages, semimodular lattices, and branching and shelling processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1069309)