DE1414286U
(enrdf_load_stackoverflow )
Andraşiu et al.
1993
Language-theoretic problems arising from Richelieu cryptosystems
DE1428845U
(enrdf_load_stackoverflow )
Da Costa
2001
On graph products of automatic monoids
Broda et al.
2017
On the mother of all automata: the position automaton
LaCroix et al.
2020
Foatic actions of the symmetric group and fixed-point homomesy
Wang
1990
The Newhouse set has a positive Hausdorff dimension
Plaehn
2004
Computing the most probable parse for a discontinuous phrase structure grammar
Ceccherini-Silberstein
2007
Growth and ergodicity of context-free languages II: The linear case
Brito et al.
2004
Competitive analysis of organization networks or multicast acknowledgement: how much to wait?
Reis
0
On the Mother of All Automata: The Position Automaton
DE1385904U
(enrdf_load_stackoverflow )
Anselmo
2000
A non-ambiguous language factorization problem
Shutt
1995
Self-modifying finite automata-Power and limitations
Dukhovny
2025
Definition formula for probabilities of independent events as a consequence of the Insufficient Reason Principle
DE1497533U
(enrdf_load_stackoverflow )
Sarvar
2024
UCHINCHI TARTIBLI KELI DARAXTIDA ANIQLANGAN SPIN QIYMATI SANOQLI BOLGAN BLYUM-KAPEL MODELI UCHUN ASOSIY HOLATLAR
Jackiewicz et al.
2025
Solving the Recoverable Robust Shortest
DE1354592U
(enrdf_load_stackoverflow )
Calera-Rubio et al.
2004
Identifying left-right deterministic linear languages
SAS et al.
0
Badanie sztywności gruntu spoistego w zmodyfikowanej kolumnie rezonansowej
Antichi et al.
2009
Second-order differential encoding of deterministic finite automata
Trees
0
Compiler Construction I
Aarts
1992
Uniform recognition for acyclic context-sensitive grammars is NP-complete
Zhang et al.
2005
Minimizing the lengths of test sequences with overlapping