A syntactic congruence for languages of birooted trees

DOI10.1007/s00233-014-9677-xzbMath1333.68185OpenAlexW1988961929MaRDI QIDQ906981

Achim Blumensath, David Janin

Publication date: 1 February 2016

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00233-014-9677-x

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (1)

On labeled birooted tree languages: algebras, automata and logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proper two-sided restriction semigroups and partial actions.
• Presentations of inverse monoids
• Actions and partial actions of inductive constellations.
• The monadic theory of order
• McAlister semigroups
• The local structure of tilings and their integer group of coinvariants
• Reversible, irreversible and optimal \(\lambda\)-machines
• Tiling semigroups
• The recognizability of sets of graphs is a robust property
• On Languages of One-Dimensional Overlapping Tiles
• Towards a Higher-Dimensional String Theory for the Modeling of Computerized Systems
• On free inverse monoid languages
• Overlapping Tile Automata
• Inverse Semigroups Which are Separated Over a Subsemigroup
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Algebras, Automata and Logic for Languages of Labeled Birooted Trees
• ADVANCED SYNCHRONIZATION OF AUDIO OR SYMBOLIC MUSICAL PATTERNS: AN ALGEBRAIC APPROACH

This page was built for publication: A syntactic congruence for languages of birooted trees