Complexity of automatic sequences (Q5918530)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7601275

Language	Label	Description	Also known as
English	Complexity of automatic sequences	scientific article; zbMATH DE number 7601275

Statements

scholarly article

0 references

Complexity of automatic sequences (English)

0 references

0 references

0 references

Information and Computation

0 references

publication date

13 October 2022

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ic.2021.104710

0 references

Automatic Sequences

0 references

Learning regular sets from queries and counterexamples

0 references

The Magma algebra system. I: The user language

0 references

Uniform tag sequences

0 references

Tools and algorithms for the construction and analysis of systems. 14th international conference, TACAS 2008, held as part of the joint European conferences on theory and practice of software, ETAPS 2008, Budapest, Hungary, March 29--April 6, 2008. Proceedings

0 references

0 references

Mix-Automatic Sequences

0 references

0 references

THE RANGES OF STATE COMPLEXITIES FOR COMPLEMENT, STAR, AND REVERSAL OF REGULAR LANGUAGES

0 references

0 references

Expansion complexity and linear complexity of sequences over finite fields

0 references

Decidability and Enumeration for Automatic Sequences: A Survey

0 references

Complexity of automatic sequences

0 references

Identifiers

10.1016/j.ic.2021.104710

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5918530

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5918530&oldid=37187593"