A syntactic congruence for languages of birooted trees
type: Item
instance of: scholarly article
title: A syntactic congruence for languages of birooted trees
zbMATH Open document ID: 1333.68185
author: Achim Blumensath
author: David Janin
published in: Semigroup Forum
publication date: 2016-02-01T00:00:00Z
Mathematics Subject Classification ID: 68Q70
Mathematics Subject Classification ID: 20M35
zbMATH DE Number: 6537651
MaRDI profile type: Publication
full work available at URL: s00233-014-9677-x
OpenAlex ID: W1988961929
cites work: ADVANCED SYNCHRONIZATION OF AUDIO OR SYMBOLIC MUSICAL PATTERNS: AN ALGEBRAIC APPROACH
cites work: Q3086921
cites work: Q3731650
cites work: Proper two-sided restriction semigroups and partial actions.
cites work: The recognizability of sets of graphs is a robust property
cites work: Reversible, irreversible and optimal \(\lambda\)-machines
cites work: Q5313940
cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
cites work: Actions and partial actions of inductive constellations.
cites work: Q5393094
cites work: Algebras, Automata and Logic for Languages of Labeled Birooted Trees
cites work: On Languages of One-Dimensional Overlapping Tiles
cites work: Overlapping Tile Automata
cites work: Towards a Higher-Dimensional String Theory for the Modeling of Computerized Systems
cites work: On free inverse monoid languages
cites work: Q5509710
cites work: The local structure of tilings and their integer group of coinvariants
cites work: Tiling semigroups
cites work: Q4537454
cites work: McAlister semigroups
cites work: Q3681954
cites work: Inverse Semigroups Which are Separated Over a Subsemigroup
cites work: The monadic theory of order
cites work: Presentations of inverse monoids
cites work: Q4362730
DOI: 10.1007/S00233-014-9677-X
description: scientific article; zbMATH DE number 6537651