Results 41 to 50 of about 43,821 (313)

A Characterization of Morphic Words with Polynomial Growth [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2020
A morphic word is obtained by iterating a morphism to generate an infinite word, and then applying a coding. We characterize morphic words with polynomial growth in terms of a new type of infinite word called a $\textit{zigzag word}$.
Tim Smith
doaj   +1 more source

Algebraic Language Theory for Eilenberg--Moore Algebras [PDF]

open access: yesLogical Methods in Computer Science, 2021
We develop an algebraic language theory based on the notion of an Eilenberg--Moore algebra. In comparison to previous such frameworks the main contribution is the support for algebras with infinitely many sorts and the connection to logic in form of so ...
Achim Blumensath
doaj   +1 more source

Most Complex Regular Ideal Languages [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2016
A right ideal (left ideal, two-sided ideal) is a non-empty language $L$ over an alphabet $\Sigma$ such that $L=L\Sigma^*$ ($L=\Sigma^*L$, $L=\Sigma^*L\Sigma^*$). Let $k=3$ for right ideals, 4 for left ideals and 5 for two-sided ideals. We show that there
Janusz Brzozowski   +2 more
doaj   +1 more source

New tools for state complexity [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2020
A monster is an automaton in which every function from states to states is represented by at least one letter. A modifier is a set of functions allowing one to transform a set of automata into one automaton.
Pascal Caron   +3 more
doaj   +1 more source

Parametric updates in parametric timed automata [PDF]

open access: yesLogical Methods in Computer Science, 2021
We introduce a new class of Parametric Timed Automata (PTAs) where we allow clocks to be compared to parameters in guards, as in classic PTAs, but also to be updated to parameters.
Étienne André   +2 more
doaj   +1 more source

Decidability of multiset, set and numerically decipherable directed figure codes [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2017
Codes with various kinds of decipherability, weaker than the usual unique decipherability, have been studied since multiset decipherability was introduced in mid-1980s.
Włodzimierz Moczurad
doaj   +1 more source

Edit Distance for Pushdown Automata [PDF]

open access: yesLogical Methods in Computer Science, 2017
The edit distance between two words $w_1, w_2$ is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform $w_1$ to $w_2$.
Krishnendu Chatterjee   +3 more
doaj   +1 more source

Watson-Crick conjugates of words and languages [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science
In this work, we explore the concept of Watson-Crick conjugates, also known as $θ$-conjugates (where $θ$ is an antimorphic involution), of words and languages.
Kalpana Mahalingam, Anuran Maity
doaj   +1 more source

Automata Tutor v3 [PDF]

open access: yesComputer Aided Verification32nd International Conference, 2020
Computer science class enrollments have rapidly risen in the past decade. With current class sizes, standard approaches to grading and providing personalized feedback are no longer possible and new techniques become both feasible and necessary.
D’Antoni L   +4 more
europepmc   +2 more sources

Distributed Graph Automata and Verification of Distributed Algorithms [PDF]

open access: yes, 2014
Combining ideas from distributed algorithms and alternating automata, we introduce a new class of finite graph automata that recognize precisely the languages of finite graphs definable in monadic second-order logic.
Reiter, Fabian
core   +1 more source

Home - About - Disclaimer - Privacy