In mathematics and theoretical computer science, an automatic sequence (called a k-automatic sequence when one wants to indicate that the base of theâ€¦Â (More)

(More)

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

- JÃ¶rg Endrullis, Clemens Grabmayer, Dimitri Hendriks
- LATA
- 2013

Mix-automatic sequences form a proper extension of the class of automatic sequences, and arise from a generalization of finiteâ€¦Â (More)

Is this relevant?

2012

2012

- Luke Schaeffer, Jeffrey Shallit
- Int. J. Found. Comput. Sci.
- 2012

The critical exponent of an infinite word is defined to be the supremum of the exponent of each of its factors. For k-automaticâ€¦Â (More)

Is this relevant?

2009

2009

- Richard C. Wang, William W. Cohen
- ACL/IJCNLP
- 2009

An important and well-studied problem is the production of semantic lexicons from a large corpus. In this paper, we present aâ€¦Â (More)

Is this relevant?

2007

2007

- S. Nicolay, Michel Rigo
- Theor. Comput. Sci.
- 2007

We present some asymptotic results about the frequency of a letter appearing in a generalized unidimensional automatic sequenceâ€¦Â (More)

Is this relevant?

2007

2007

- Bernard Boigelot, Julien Brusten
- ICALP
- 2007

This paper studies the expressive power of finite-state automata recognizing sets of real numbers encoded positionally. It isâ€¦Â (More)

Is this relevant?

2003

2003

- Stephen A. Cook, Antonina Kolokolova
- Ann. Pure Appl. Logic
- 2003

We introduce a second-order system V1-Horn of bounded arithmetic formalizing polynomialtime reasoning, based on GrÃ¤delâ€™s [11â€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- AndrÃ© Baresel, Hartmut Pohlheim, Sadegh Sadeghipour
- GECCO
- 2003

Evolutionary Testing (ET) has been shown to be very successful for testing real world applications [10]. The original ET approachâ€¦Â (More)

Is this relevant?

2000

2000

- Michel Rigo
- Theor. Comput. Sci.
- 2000

Let L be an infinite regular language on a totally ordered alphabet (Î£, <). Feeding a finite deterministic automaton (with outputâ€¦Â (More)

Is this relevant?

1998

1998

- Fabien Durand
- Theory of Computing Systems
- 1998

If a nonperiodic sequence X is the image by a morphism of a fixed point of both a primitive substitution Ïƒ and a primitiveâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- Philipp Bucher, Amos Bairoch
- ISMB
- 1994

A general syntax for expressing biomolecular sequence motifs is described, which will be used in future releases of the PROSITEâ€¦Â (More)

Is this relevant?