Trees in Partial Higher Dimensional Automata

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-030-17127-8_13
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Higher Dimensional Automata

BRICS Report Series
2002English

Homological Properties of Non-Deterministic Branchings of Mergings in Higher Dimensional Automata

Homology, Homotopy and Applications
Mathematics
2005English

Partial Derivative Automata Formalized in Coq

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Synchronizing Automata Preserving a Chain of Partial Orders

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2009English

Weakly Pointed Trees and Partial Injections

Journal of Symbolic Logic
PhilosophyLogic
2008English

Reversibility and Quantum Coherence in One-Dimensional Quantum Cellular Automata

Physical Review A
OpticsAtomicMolecular Physics,
2018English

Assessing Cellular Automata Based Models Using Partial Differential Equations

Mathematical and Computer Modelling
2004English

Hybrid One-Dimensional Reversible Cellular Automata Are Regular

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2007English

Higher-Order Pushdown Trees Are Easy

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy