DE1414286U
(Direct )
Brandt et al.
2000
Closure and stable Hamiltonian properties in claw‐free graphs
Rashad et al.
2018
A note on unar LA-semigroup
Da Costa
2001
On graph products of automatic monoids
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
Dukhovny
2025
Definition formula for probabilities of independent events as a consequence of the Insufficient Reason Principle
Ceccherini-Silberstein
2007
Growth and ergodicity of context-free languages II: The linear case
Sin'ya
2019
Simple proof of Parikh's theorem a la Takahashi
Reis
0
On the Mother of All Automata: The Position Automaton
DE1484733U
(Direct )
DE1385904U
(Direct )
Anselmo
2000
A non-ambiguous language factorization problem
Liu et al.
0
Causal commutative arrows revisited
Shutt
1995
Self-modifying finite automata-Power and limitations
Ezhilarasu et al.
2014
A Novel Approach to Classify Nondeterministic Finite Automata Based on Single Loop and its Position
DE1497533U
(Direct )
Ferng
2004
Modeling of split traffic under probabilistic routing
DE1354592U
(Direct )
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
Basirat et al.
2020
Greedy Transition-Based Dependency Parsing with Discrete and Continuous Supertag Features
DE1447512U
(Direct )
Zhang et al.
2005
Minimizing the lengths of test sequences with overlapping