Results 21 to 30 of about 1,772,421 (241)
Testing the Equivalence of Regular Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 The minimal deterministic finite automaton is generally used to determine regular languages equality. Antimirov and Mosses proposed a rewrite system for deciding regular expressions equivalence of which Almeida et al. presented an improved variant. Hopcroft and Karp proposed an almost linear algorithm for testing the equivalence of two deterministic ...
Nelma Moreira +2 more
openaire +5 more sources
Index problems for game automata [PDF]
, 2016 For a given regular language of infinite trees, one can ask about the minimal number of priorities needed to recognize this language with a non-deterministic, alternating, or weak alternating parity automaton.
Facchini, Alessandro +2 more
core +1 more source
On the Hierarchy of Block Deterministic Languages
, 2015 A regular language is $k$-lookahead deterministic (resp. $k$-block deterministic) if it is specified by a $k$-lookahead deterministic (resp. $k$-block deterministic) regular expression.
A Brüggemann-Klein +9 more
core +2 more sources
Parikh's Theorem: A simple and direct automaton construction
, 2011 Parikh's theorem states that the Parikh image of a context-free language is semilinear or, equivalently, that every context-free language has the same Parikh image as some regular language. We present a very simple construction that, given a context-free
Aceto +18 more
core +1 more source
Practical experiments with regular approximation of context-free languages [PDF]
, 1999 Several methods are discussed that construct a finite automaton given a context-free grammar, including both methods that lead to subsets and those that lead to supersets of the original context-free language.
Nederhof, Mark-Jan
core +4 more sources
One-Unambiguous Regular Languages
Information and Computation, 1998 AbstractThe ISO standard for the Standard Generalized Markup Language (SGML) provides a syntactic meta-language for the definition of textual markup systems. In the standard, the right-hand sides of productions are based on regular expressions, although only regular expressions that denote words unambiguously, in the sense of the ISO standard, are ...
Bruggemann-Klein, Anne, Wood, Derick
openaire +5 more sources
$k$-Universality of Regular Languages
, 2023 A subsequence of a word $w$ is a word $u$ such that $u = w[i_1] w[i_2] \dots w[i_{k}]$, for some set of indices $1 \leq i_1 < i_2 < \dots < i_k \leq \lvert w\rvert$. A word $w$ is $k$-subsequence universal over an alphabet $Σ$ if every word in $Σ^k$ appears in $w$ as a subsequence. In this paper, we study the intersection between the set of $k$
Adamson, Duncan +5 more
openaire +5 more sources
Complexity of Problems of Commutative Grammars [PDF]
, 2015 We consider commutative regular and context-free grammars, or, in other words, Parikh images of regular and context-free languages. By using linear algebra and a branching analog of the classic Euler theorem, we show that, under an assumption that the ...
Kopczynski, Eryk
core +1 more source
Regularity of splicing languages
Discrete Applied Mathematics, 1996 AbstractMotivated by the recombinant behavior of DNA, Tom Head introduced a scheme for the evolution of formal languages called splicing. We give a simpler proof of the fundamental fact that the closure of a regular language under iterated splicing using a finite number of splicing rules is again regular.
openaire +2 more sources
Social context prevents heat hormetic effects against mutagens during fish development
FEBS Letters, EarlyView.This study shows that sublethal heat stress protects fish embryos against ultraviolet radiation, a concept known as ‘hormesis’. However, chemical stress transmission between fish embryos negates this protective effect. By providing evidence for the mechanistic molecular basis of heat stress hormesis and interindividual stress communication, this study ...
Lauric Feugere +5 more
wiley +1 more source