:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Berlinkov, Mikhail V.
Format:	Preprint
Published:	2013
Subjects:	Formal Languages and Automata Theory Discrete Mathematics Combinatorics F.4.3
Online Access:	https://arxiv.org/abs/1304.5774
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Myhill-Nerode Type Characterization of 2detLIN Languages
by: Nagy, Benedek
Published: (2025)

The Repetition Threshold for Rote Sequences
by: Ollinger, Nicolas, et al.
Published: (2024)

String Attractors for Automatic Sequences
by: Schaeffer, Luke, et al.
Published: (2020)

Some Fibonacci-Related Sequences
by: Cloitre, Benoit, et al.
Published: (2023)

Runs in Paperfolding Sequences
by: Shallit, Jeffrey
Published: (2024)

Self-Verifying Predicates in Büchi Arithmetic
by: Khodier, Mazen, et al.
Published: (2025)

Careful synchronisation and the diameter of transformation semigroups with few generators
by: Ryzhikov, Andrew
Published: (2025)

Dyck Words, Pattern Avoidance, and Automatic Sequences
by: Mol, Lucas, et al.
Published: (2023)

Asymptotic bounds for the number of closed and privileged words
by: Gabric, Daniel
Published: (2022)

Pseudoperiodic Words and a Question of Shevelev
by: Meleshko, Joseph, et al.
Published: (2022)

Some Remarks on Palindromic Periodicities
by: Fici, Gabriele, et al.
Published: (2024)

Linear Recurrence Sequence Automata and the Addition of Abstract Numeration Systems
by: Carton, Olivier, et al.
Published: (2024)

On shortest products for nonnegative matrix mortality
by: Ryzhikov, Andrew
Published: (2024)

The Smallest String Attractors of Fibonacci and Period-Doubling Words
by: Banbara, Mutsunori, et al.
Published: (2026)

Automatic Abelian Complexities of Parikh-Collinear Fixed Points
by: Rigo, Michel, et al.
Published: (2024)

Banach density of generated languages: Dichotomies in topology and dimension
by: Kleinberg, Jon, et al.
Published: (2026)

Repetition Threshold for Binary Automatic Sequences
by: Allouche, J. -P., et al.
Published: (2024)

Ten Squares Force an Overlap
by: Shallit, Jeffrey
Published: (2026)

Antisquares and Critical Exponents
by: Baranwal, Aseem, et al.
Published: (2022)

A Language-Theoretic Approach to the Heapability of Signed Permutations
by: Istrate, Gabriel
Published: (2024)

Strongly k-recursive sequences
by: Krenn, Daniel, et al.
Published: (2024)

Complexity of Linear Subsequences of Fibonacci-Automatic Sequences
by: Moradi, Delaram, et al.
Published: (2026)

Algebraic Language Theory with Effects
by: Lenke, Fabian, et al.
Published: (2024)

Commuting upper triangular binary morphisms
by: Honkala, Juha
Published: (2023)

Active Learning Techniques for Pomset Recognizers
by: Pommellet, Adrien, et al.
Published: (2025)

Minimal History-Deterministic Co-Buchi Automata: Congruences and Passive Learning
by: Löding, Christof, et al.
Published: (2025)

A Robust Measure on FDFAs Following Duo-Normalized Acceptance
by: Fisman, Dana, et al.
Published: (2023)

Store Languages of Turing Machines and Counter Machines
by: Friesen, Noah, et al.
Published: (2025)

Active Learning of Upward-Closed Sets of Words
by: Aristote, Quentin
Published: (2025)

Deciding DFA-Primality is NP-Hard
by: Spenner, Daniel Alexander
Published: (2026)

Planning with Probabilistic Opacity and Transparency: A Computational Model of Opaque/Transparent Observations
by: Udupa, Sumukha, et al.
Published: (2024)

Verifying Unboundedness via Amalgamation
by: Anand, Ashwani, et al.
Published: (2024)

Omega-Regular Robustness
by: Fisman, Dana, et al.
Published: (2025)

Runtime Consultants
by: Fisman, Dana, et al.
Published: (2025)

Learning Realtime One-Counter Automata
by: Bruyère, Véronique, et al.
Published: (2021)

On History-Deterministic One-Counter Nets
by: Prakash, Keya, et al.
Published: (2022)

Monads, Comonads, and Transducers
by: Stefański, Rafał
Published: (2024)

Automata with Timers
by: Bruyère, Véronique, et al.
Published: (2023)

How to Demonstrate Metalinearness and Regularity by Tree-Restricted General Grammars
by: Havel, Martin, et al.
Published: (2024)

A Myhill-Nerode style Characterization for Timed Automata With Integer Resets
by: Doveri, Kyveli, et al.
Published: (2024)