Profinite Methods in Automata Theory
From MaRDI portal
Publication:5389964
DOI10.4230/LIPIcs.STACS.2009.1856zbMath1236.68175OpenAlexW1605891657MaRDI QIDQ5389964
Publication date: 24 April 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_e3ef.html
Related Items (24)
TOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES ⋮ Stone Duality and the Recognisable Languages over an Algebra ⋮ Dual Space of a Lattice as the Completion of a Pervin Space ⋮ The p-adic Theory of Automata Functions ⋮ Limits of schema mappings ⋮ On the group of a rational maximal bifix code ⋮ Classes of Languages Generated by the Kleene Star of a Word ⋮ Ultrafilters on words for a fragment of logic ⋮ The omega-reducibility of pseudovarieties of ordered monoids representing low levels of concatenation hierarchies ⋮ A duality theoretic view on limits of finite structures ⋮ The non-Archimedean theory of discrete systems ⋮ Upper set monoids and length preserving morphisms ⋮ Unnamed Item ⋮ Theme and Variations on the Concatenation Product ⋮ Profinite techniques for probabilistic automata and the Markov monoid algorithm ⋮ Automata finiteness criterion in terms of van der Put series of automata functions ⋮ On a nonlinear \(p\)-adic dynamical system ⋮ The expressive power of the shuffle product ⋮ Classes of languages generated by the Kleene star of a word ⋮ A topological approach to non-uniform complexity ⋮ Stone duality, topological algebra, and recognition. ⋮ \(p\)-adic (3, 2)-rational dynamical systems ⋮ Unnamed Item ⋮ Shift-invariant topologies for the Cantor space \(X^{\omega}\)
This page was built for publication: Profinite Methods in Automata Theory
