Opacity complexity of automatic sequences: the general case
From MaRDI portal
Cites work
- A general language-based framework for specifying and verifying notions of opacity
- A new complexity function for words based on periodicity
- A new complexity function, repetitions in Sturmian words, and irrationality exponents of Sturmian numbers
- Abelian combinatorics on words: a survey
- An approximate distribution for the maximum order complexity
- Another generalization of abelian equivalence: binomial complexity of infinite words
- Automatic Sequences
- Characterization of opaque automata
- Complexity for finite factors of infinite sequences
- Complexity of sequences and dynamical systems
- Cyclic complexity of words
- Degrees of infinite words, polynomials and atoms
- Econometrics.
- Enforcing current-state opacity through shuffle and deletions of event observations
- Eulerian entropy and non-repetitive subword complexity
- Hankel determinants, Padé approximations, and irrationality exponents
- scientific article; zbMATH DE number 177152 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 912986 (Why is no real title available?)
- scientific article; zbMATH DE number 5583830 (Why is no real title available?)
- scientific article; zbMATH DE number 3205709 (Why is no real title available?)
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- Introducing privileged words: privileged complexity of Sturmian words
- Lie complexity of words
- New string attractor-based complexities for infinite words
- On a generalization of abelian equivalence and complexity of infinite words
- On a new notion of complexity on infinite words
- On abelian and additive complexity in infinite words
- On the base-dependence of sets of numbers recognizable by finite automata
- On the complexity of algebraic numbers. I: Expansions in integer bases
- On the Complexity of Finite Sequences
- On the complexity of infinite sequences
- Opacity of a finite automaton, method of calculation and the Ising chain
- Opacity of an automaton. Application to inhomogeneous Ising chain
- Opacity of finite automata
- Opacity of networked discrete event systems
- Palindrome complexity.
- Preservation of normality by transducers
- Preservation of normality by unambiguous transducers
- Probabilistic opacity for Markov decision processes
- Progress in Cryptology - INDOCRYPT 2003
- Sequence entropy and the maximal pattern complexity of infinite words
- Some properties of Ising automata
- State complexity of binary coded regular languages
- The opacity of backbones
- The reflection complexity of sequences over finite alphabets
- Uniform tag sequences
This page was built for publication: Opacity complexity of automatic sequences: the general case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6855665)
