DE1414286U
(enExample )
Galinier et al.
2003
A constraint-based approach to the Golomb ruler problem
Khasidashvili et al.
2001
Uniform normalisation beyond orthogonality
Da Costa
2001
On graph products of automatic monoids
El Idrissi et al.
2018
Greedy heuristics for identical parallel machine scheduling problem with single server to minimize the makespan
LaCroix et al.
2020
Foatic actions of the symmetric group and fixed-point homomesy
Broda et al.
2017
On the mother of all automata: the position automaton
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
Reis
0
On the Mother of All Automata: The Position Automaton
DE1385904U
(enExample )
Anselmo
2000
A non-ambiguous language factorization problem
Shutt
1995
Self-modifying finite automata-Power and limitations
Azamat et al.
2024
QALQONSIMON BEZ VA UNING VAZIFALARI
Ferng
2004
Modeling of split traffic under probabilistic routing
Jackiewicz et al.
2025
Solving the Recoverable Robust Shortest
DE1354592U
(enExample )
Uzakova
0
The Content and Essence of the Mechanism of Development of Enterprises in the Construction Materials Industry
Calera-Rubio et al.
2004
Identifying left-right deterministic linear languages
Imaev et al.
2007
Spectral properties for the max plus dynamics matrix for flow shops
SAS et al.
0
Badanie sztywności gruntu spoistego w zmodyfikowanej kolumnie rezonansowej
DE1447512U
(enExample )
Trees
0
Compiler Construction I
Aarts
1992
Uniform recognition for acyclic context-sensitive grammars is NP-complete