Results 281 to 290 of about 283,589 (317)

Learning a deterministic finite automaton with a recurrent neural network

1998
We consider the problem of learning a finite automaton with recurrent neural networks from positive evidence. We train an Elman recurrent neural network with a set of sentences in a language and extract a finite automaton by clustering the states of the trained network.
Laura Firoiu, Tim Oates, Paul R. Cohen
openaire   +1 more source

Quasi-deterministic virtual finite automaton (QDVFA) of order \(s\)

2009
Summary: In this paper, we introduce the notion of Quasi-deterministic Virtual Finite Automaton (QDVFA) of order \((s,t)\) and study the language recognition capabilities of the same.
Jain, A., Lee, J.-S.
openaire   +2 more sources

Deterministic Recognition of Trees Accepted by a Linear Pushdown Tree Automaton

2006
In this paper, a deterministic recognition algorithm for the class of tree languages accepted by (nondeterministic) linear pushdown tree automata (L-PDTAs) is proposed. L-PDTAs accept an important class of tree languages since the class of their yield languages coincides with the class of yield languages generated by tree adjoining grammars (TAGs). The
Akio Fujiyoshi, Ikuo Kawaharada
openaire   +1 more source

Approximation methods for the construction of the deterministic model of a non-deterministic weighted automaton:

2012
discounting max-plus . online
openaire   +1 more source

An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton

International Conference on Implementation and Application of Automata, 2009
M. Holzer, A. Maletti
semanticscholar   +1 more source

Learning Deterministic Visibly Pushdown Automata Under Accessible Stack

International Symposium on Mathematical Foundations of Computer Science, 2022
Jakub Michaliszyn, J. Otop
semanticscholar   +1 more source

The Minimal Deterministic Finite-State Automaton for a Finite Language

2019
A fundamental task in natural language processing is the efficient representation of lexica. From a computational viewpoint, lexica need to be represented in a way directly supporting fast access to entries, and minimizing space requirements. A standard method is to represent lexica as minimal deterministic (classical) finite-state automata.
openaire   +1 more source

Catalytic cracking of biomass tar for hydrogen-rich gas production: Parameter optimization using response surface methodology combined with deterministic finite automaton

Renewable Energy
Xueqin Li, Pengbo Liu, Zhiwei Wang, Pengbo Liu, Xiao Wei, Youqing Wu, Tingzhou Lei   +6 more
semanticscholar   +1 more source

Exact Thermalization Dynamics in the “Rule 54” Quantum Cellular Automaton

Physical Review Letters, 2021
Katja Klobas, Bruno Bertini, Lorenzo Piroli   +2 more
exaly  

Multiscale modeling of discontinuous dynamic recrystallization during hot working by coupling multilevel cellular automaton and finite element method

International Journal of Plasticity, 2021
Fei Chen, Hengan Ou, Zhenshan Cui
exaly