Languages of Profinite Words and the Limitedness Problem

DOI10.1007/978-3-642-31585-5_35zbMath1433.03104OpenAlexW2220644212MaRDI QIDQ3167027

Szymon Toruńczyk

Publication date: 1 November 2012

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31585-5_35

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Higher-order logic (03B16)

Related Items (3)

Recognisable Languages over Monads ⋮ Limits of schema mappings ⋮ Profinite techniques for probabilistic automata and the Markov monoid algorithm

This page was built for publication: Languages of Profinite Words and the Limitedness Problem