On labeled birooted tree languages: algebras, automata and logic
From MaRDI portal
Publication:2347808
Recommendations
Cites work
- A syntactic congruence for languages of birooted trees
- Adequate Semigroups
- Advanced synchronization of audio or symbolic musical patterns: an algebraic approach
- Algebraic tools for the overlapping tile product
- Algebras, automata and logic for languages of labeled birooted trees
- AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS
- E-unitary covers for inverse semigroups
- EQUATIONS IN FREE INVERSE MONOIDS
- First-order logic on finite trees
- Free inverse semigroups
- Free Inverse Semigroups
- From right PP monoids to restriction semigroups: a survey.
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Graph structure and monadic second-order logic. A language-theoretic approach
- scientific article; zbMATH DE number 5872386 (Why is no real title available?)
- scientific article; zbMATH DE number 988807 (Why is no real title available?)
- scientific article; zbMATH DE number 3869616 (Why is no real title available?)
- scientific article; zbMATH DE number 5286867 (Why is no real title available?)
- scientific article; zbMATH DE number 3903987 (Why is no real title available?)
- scientific article; zbMATH DE number 3963900 (Why is no real title available?)
- scientific article; zbMATH DE number 3976380 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1761434 (Why is no real title available?)
- scientific article; zbMATH DE number 2206109 (Why is no real title available?)
- scientific article; zbMATH DE number 3339435 (Why is no real title available?)
- Inverse Monoids, Trees, and Context-Free Languages
- Inverse monoids: decidability and complexity of algebraic questions.
- Inverse Semigroups Which are Separated Over a Subsemigroup
- McAlister semigroups
- Modeling in Event B. System and software engineering.
- On free inverse monoid languages
- On languages of one-dimensional overlapping tiles
- Overlapping tile automata
- Presentations of inverse monoids
- Quasi-recognizable vs MSO definable languages of one-dimensional overlapping tiles (extended abstract)
- Recognisability for algebras of infinite trees
- Restriction and Ehresmann semigroups.
- Right PP monoids with central idempotents
- Semigroups and ordered categories. I: The reduced case
- The Ehresmann-Schein-Nambooripad theorem and its successors
- THE FREE AMPLE MONOID
- The local structure of tilings and their integer group of coinvariants
- The monadic theory of order
- Tiling semigroups
- Towards a higher-dimensional string theory for the modeling of computerized systems
- Tree-Walking Automata
- Two-way Automata and Regular Languages of Overlapping Tiles
- Universal groups for point-sets and tilings.
- Wreath products of forest algebras, with applications to tree logics
Cited in
(6)- Characterizations of recognizable weighted tree languages by logic and bimorphisms
- Walking automata in free inverse monoids
- Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms — Revisited
- Language acceptability of finite automata based on theory of semi-tensor product of matrices
- Algebras, automata and logic for languages of labeled birooted trees
- A syntactic congruence for languages of birooted trees
This page was built for publication: On labeled birooted tree languages: algebras, automata and logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2347808)
