Results 21 to 30 of about 1,306,361 (48)

WQO is decidable for factorial languages [PDF]

, 2017
A language is factorial if it is closed under taking factors, i.e. contiguous subwords. Every factorial language can be described by an antidictionary, i.e. a minimal set of forbidden factors.
Moshkov, Mikhail, Moshkov, M., Aistis Atminas, Lozin, Vadim V., Mikhail Moshkov, Vadim Lozin, Lozin, Vadim, Atminas, Aistis   +7 more
core   +1 more source

1 Finite-State Automata: Characterization Finite-State Acceptors [PDF]

, 2012
Definition (Non-deterministic finite-state acceptor (NFA)) A non-deterministic finite-state acceptor A is a 5-tuple (Q, Σ, q0, F, δ) where Q is a finite set of states Σ is the alphabet q0 ∈ Q is the start state F ⊆ Q is a set of final states δ: Q × Σ ...
Nina Seemann, Finite-state Transducers
core  

Finite element method using vector finite elements applied to eddy current problems [PDF]

, 2011
Vector fields found in electromagnetics are fundamentally different to vector fields found in other research areas such as structural mechanics. Electromagnetic vector fields possess different physical behaviour patterns and different properties in ...
Adams, Leila
core   +1 more source

Finite element reduced order models for nonlinear vibrations of piezoelectric layered beams with applications to NEMS [PDF]

, 2012
This article presents a finite element reduced order model for the nonlinear vibrations of piezoelectric layered beams with application to NEMS. In this model, the geometrical nonlinearities are taken into account through a von Kármán nonlinear strain ...
O. Thomas, LAZARUS, Arnaud, THOMAS, Olivier, A. Lazarus, J.-F. Deü, DEÜ, Jean-François   +5 more
core   +1 more source

Deciding WQO for factorial languages

, 2013
A language is factorial if it is closed under taking factors (i.e. contiguous subwords). Every factorial language can be described by an antidictionary, i.e. a minimal set of forbidden factors.
Moshkov, Mikhail, Aistis Atminas, Lozin, Vadim V., Mikhail Moshkov, Vadim Lozin, Atminas, Aistis   +5 more
core   +1 more source

The probability of generating a finite simple group [PDF]

, 2013
We study the probability of generating a finite simple group, together with its generalisation PG,socG(d), the conditional probability of generating an almost simple finite group G by d elements, given that these elements generate G/ socG.
Colva M. Roney-Dougal, Martyn Quick, Quick, Martyn, Nina E. Menezes, Roney-Dougal, Colva Mary, Menezes, Nina Emma   +5 more
core   +1 more source

Minimizing finite automata is computationally hard [PDF]

, 2002
It is known that deterministic finite automata (DFAs) can be algorithmically minimized, i.e., a DFA M can be converted to an equivalent DFA M' which has a minimal number of states. The minimization can be done efficiently [6].
Malcher, Andreas
core  

Unramified representations of reductive groups over finite rings [PDF]

, 2009
Lusztig has given a construction of certain representations of reductive groups over finite local principal ideal rings of characteristic p, extending the construction of Deligne and Lusztig of representations of reductive groups over finite fields.
Stasinski, Alexander
core   +1 more source

Generation problems for finite groups [PDF]

, 2012
It can be deduced from the Burnside Basis Theorem that if G is a finite p-group with d(G)=r then given any generating set A for G there exists a subset of A of size r that generates G. We have denoted this property B.
McDougall-Bagnall, Jonathan M.
core   +2 more sources

Languages with finite antidictionaries: growth index and properties of automata [PDF]

, 2010
Статья поступила 17.04.2008, окончательный вариант 04.04.2008.Рассматриваются факториальные языки с конечным антисловарем и экспоненциальной функцией сложности, а также распознающие их автоматы.
Shur, A. M., Шур, А. М.
core