MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "On Minimizing Finite Automata." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

27 documents found, showing 1 through 10. Next 10 →

ATOM

A Parallel Algorithm for Minimization of Finite Automata
by B. Ravikumar, X. Xiong — 1996 — in Proceedings of 10th International Parallel Processing Symposium
…A Parallel Algorithm for Minimization of Finite Automata B. Ravikumar X. Xiong Department…
Cited by 3 (2 self) – Add To MetaCart

A Learning Method for Recurrent Networks Based on Minimization of Finite Automata
by Itsuki Noda. Makoto Nagao — 1992
…A Learning Method for Recurrent Networks Based on Minimization of Finite Automata Itsuki NODA…
Add To MetaCart

Efficient Minimization of Deterministic Weak ω-Automata
by Christof Löding — 2001
…-Büchi automata. We reduce the problem to the minimization of finite automata on finite words and obtain…
Cited by 2 (0 self) – Add To MetaCart

The Mathematics and Mechanics of Relating Formal Theories
by Robert L. Constable, Robert L. Constable, Paul B. Jackson, Pavel Naumov, Juan Uribe
… minimization in finite automata theory. We follow the account in Hopcroft and Ullman's book Formal Languages…
Add To MetaCart

Constructively Formalizing Automata Theory
by Robert L. Constable, Paul B. Jackson, Pavel Naumov, Juan Uribe — 1997 — Proof, Language and Interaction: Essays in Honour of Robert Milner
…-Nerode theorem on the minimization of finite automata that follows the account in Hopcroft and Ullman's book…
Cited by 4 (0 self) – Add To MetaCart

Minimal Unambiguous εNFA
by Sebastian John — 2004
… to the standard techniques to minimize deterministic complete finite automata (complete DFA) two novel features…
Add To MetaCart

A Model of Recurrent Networks that Learn the Finite Automaton from Given Input-Output Sequences
by Itsuki Noda — 1992 — In International Symbosium on Neural Information Processing (as a part of International Symposia on Information Sciences (ISKIT '92
… model). This algorithm is derived from the minimization procedure of finite automata under…
Cited by 1 (1 self) – Add To MetaCart

Deterministic Generalized Automata
by Dora Giammarresi, Rosa Montalbano — 1995 — Theoretical Computer Science
… and automata. Then we recall some definitions, properties and problems related to the minimization of finite…
Cited by 8 (1 self) – Add To MetaCart

Deterministic Generalized Automata
by Dora Giammarresi Dipartimento, Dora Giammarresi, Rosa Montalbano — 1995 — Theoretical Computer Science
… and automata. Then we recall some definitions, properties and problems related to the minimization of finite…
Add To MetaCart

Arithmetic Meyer sets and finite automata
by Shigeki Akiyama, Frédérique Bassino, Christiane Frougny — 2005 — Information and Computation
… theory. We first give the minimal finite automata describing the formal addition and subtraction…
Cited by 1 (0 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB