scientific article; zbMATH DE number 7453075
From MaRDI portal
Publication:5020521
Émilie Charlier, Célia Cisternino, Adeline Massuir
Publication date: 6 January 2022
Full work available at URL: https://arxiv.org/abs/1909.07676
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The growth function of \(S\)-recognizable sets
- Finite-state \(\omega\)-languages
- Thue, combinatorics on words, and conjectures inspired by the Thue-Morse sequence
- Logic and \(p\)-recognizable sets of integers
- Bertrand numeration systems and recognizability
- The definable criterion for definability in Presburger arithmetic and its applications.
- The ring of \(k\)-regular sequences. II.
- Minimal DFA for testing divisibility
- Minimal automaton for multiplying and translating the Thue-Morse set
- Periodicity, repetitions, and orbits of an automatic sequence
- An analogue of Cobham's theorem for graph directed iterated function systems
- Enumeration and Automatic Sequences
- A decision method for the recognizability of sets defined by number systems
- Representations of numbers and finite automata
- Automatic Sequences
- ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
- Decidability of the HD0L ultimate periodicity problem
- An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention
- Formal Languages, Automata and Numeration Systems 2
- Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure
- Number representation and finite automata
- On the base-dependence of sets of numbers recognizable by finite automata
- Uniform tag sequences
This page was built for publication:
