Unique decomposition of homogeneous languages and application to isothetic regions
DOI10.1017/S0960129518000294zbMath1418.68129OpenAlexW2896864776MaRDI QIDQ4629267
Publication date: 21 March 2019
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129518000294
Graph theory (including graph drawing) in computer science (68R10) Algebraic theory of languages and automata (68Q70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- The structure of countable Boolean algebras
- A convenient category of locally preordered spaces
- Tensor products of semilattices and distributive lattices
- Graph-theoretical versus topological ends of graphs.
- The de Rham decomposition theorem for metric spaces
- Algebraic topology and concurrency
- Directed algebraic topology and concurrency. With a foreword by Maurice Herlihy and a preface by Samuel Mimram
- On direct product desomposition of partially ordered sets
- Introduction to Boolean Algebras
- A Geometric Approach to the Problem of Unique Decomposition of Processes
- The geometry of semaphore programs
- The Semilattice Tensor Product of Distributive Lattices
- Higher dimensional automata revisited
- The Tensor Product of Semigroups
- The Tensor Product of Commutative Semigroups
- On a Problem of G. Birkhoff
- Cartesian products of Boolean algebras
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Unique decomposition of homogeneous languages and application to isothetic regions
