The algebras for automatic relations
From MaRDI portal
Cites work
- Algebraic recognition of regular functions
- ASH'S TYPE II THEOREM, PROFINITE TOPOLOGY AND MALCEV PRODUCTS: PART I
- Automata Presenting Structures: A Survey of the Finite String Case
- Automatic presentations of structures
- Categories as algebra: An essential ingredient in the theory of monoids
- Continuity of functional transducers: a profinite study of rational functions
- Decision problems among the main subfamilies of rational relations
- Foundations of graph path query languages. Course notes for the reasoning web summer school 2021
- 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 3841819 (Why is no real title available?)
- scientific article; zbMATH DE number 1189235 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 2206109 (Why is no real title available?)
- INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
- Logical and algebraic characterizations of rational transductions
- MSO definable string transductions and two-way finite-state transducers
- On direct products of automaton decidable theories
- POINTLIKE SETS, HYPERDECIDABILITY AND THE IDENTITY PROBLEM FOR FINITE SEMIGROUPS
- Resynchronizing classes of word relations
- Series formelles et algèbres syntactiques
- Some algorithmic problems for pseudovarieties
- Some natural decision problems in automatic graphs
- Synchronizing relations on words
- Varieties
This page was built for publication: The algebras for automatic relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7261427)
