On the bijective colouring of Cantor trees based on transducers

DOI10.1016/J.DISC.2022.112855OpenAlexW4212817810WikidataQ114190541 ScholiaQ114190541MaRDI QIDQ2124646FDOQ2124646

Authors: Adam Woryna 

Publication date: 11 April 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2202.10131

Recommendations

• Implementation and Application of Automata
• Combinatorial variations on Cantor's diagonal
• Partitioning infinite trees
• Colorings of trees with linear, intermediate and exponential subball complexity
• scientific article; zbMATH DE number 434895

zbMATH Keywords

automatonbijectionCantor treeshort mapfunction defined by automaton

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Automata, dynamical systems, and groups
• T-functions revisited: new criteria for bijectivity/transitivity
• Characterization of the ergodicity of 1-Lipschitz functions on \(\mathbb{Z}_2\) using the \(q\)-Mahler basis
• Mahler coefficients of \(1\)-Lipschitz measure-preserving functions on \(\mathbb{Z}_p\)
• [[Publication:897329|Criteria of measure-preservation for 1-Lipschitz functions on \(\mathbb F_qT\) in terms of the van der Put basis and its applications]]
• Title not available (Why is that?)
• Approximation of continuous functions by finite automata
• Title not available (Why is that?)

Cited In (1)

• On the bijective colouring of Cantor trees based on transducers

This page was built for publication: On the bijective colouring of Cantor trees based on transducers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2124646)