Results 21 to 30 of about 242 (42)
A General Approach to Proving Properties of Fibonacci Representations via Automata Theory
, 2023 We provide a method, based on automata theory, to mechanically prove the correctness of many numeration systems based on Fibonacci numbers. With it, long case-based and induction-based proofs of correctness can be replaced by simply constructing a ...
Shallit, Jeffrey, Shan, Sonja Linghui
core +1 more source
Measuring the Gain of Reconfigurable Communication
, 2023 We study the advantages of reconfigurable communication interfaces vs fixed communication interfaces in the context of asynchronous automata. We study the extension of asynchronous (Zielonka) automata with reconfigurable communication interfaces. We show
Lehaut, Mathieu, Piterman, Nir
core
Quantitative estimates for the size of an intersection of sparse automatic sets
, 2023 A theorem of Cobham says that if $k$ and $\ell$ are two multiplicatively independent natural numbers then a subset of the natural numbers that is both $k$- and $\ell$-automatic is eventually periodic.
Albayrak, Seda, Bell, Jason
core
Decision Problems on Copying and Shuffling
, 2023 We study decision problems of the form: given a regular or linear context-free language $L$, is there a word of a given fixed form in $L$, where given fixed forms are based on word operations copy, marked copy, shuffle and their ...
Halava, Vesa +3 more
core
Primitive Automata that are Synchronizing
, 2023 A deterministic finite (semi)automaton is primitive if its transition monoid (semigroup) acting on the set of states has no non-trivial congruences. It is synchronizing if it contains a constant map (transformation).
Rystsov, Igor, Szykuła, Marek
core
The Height of Piecewise-Testable Languages with Applications in Logical Complexity [PDF]
, 2016 The height of a piecewise-testable language L is the maximum length of the words needed to define L by excluding and requiring given subwords. The height of L is an important descriptive complexity measure that has not yet been investigated in a ...
Karandikar, Prateek +1 more
core +1 more source
Sturmian and infinitely desubstitutable words accepted by an {\omega}-automaton
, 2023 Given an $\omega$-automaton and a set of substitutions, we look at which accepted words can also be defined through these substitutions, and in particular if there is at least one.
Béaur, Pierre +1 more
core
On Some Closure Properties of nc-eNCE Graph Grammars
, 2023 In the study of automata and grammars, closure properties of the associated languages have been studied extensively. In particular, closure properties of various types of graph grammars have been examined in (Rozenberg and Welzl, Inf.
Mathew, Lisa, Vijayakumar, Jayakrishna
core
Simple and tight complexity lower bounds for solving Rabin games
, 2023 We give a simple proof that assuming the Exponential Time Hypothesis (ETH), determining the winner of a Rabin game cannot be done in time $2^{o(k \log k)} \cdot n^{O(1)}$, where $k$ is the number of pairs of vertex subsets involved in the winning ...
Casares, Antonio +4 more
core
Visualizing a Nondeterministic to Deterministic Finite-State Machine Transformation
, 2023 The transformation of a nondeterministic finite-state automaton into a deterministic finite-state automaton is an integral part of any course on formal languages and automata theory.
Minic, Tijana, Morazán, Marco T.
core