Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

INFORMATICALT
2002

favoriteEmaildiscussreport

77views more INFORMATICALT 2002»

A New Algorithm of Constructing the Basis Finite Automaton

13 years 4 months ago

A New Algorithm of Constructing the Basis Finite Automaton

Download www.mii.lt

In this paper we consider non-deterministic finite Rabin

Boris Melnikov, Alexandra Melnikova

Real-time Traffic

Basis Automaton | INFORMATICALT 2002 | Non-deterministic Finite Rabinscott | Regular Languages |

claim paper

Related Content

» Antichains A New Algorithm for Checking Universality of Finite Automata

» Minimal CoverAutomata for Finite Languages

» Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA

» Compilation Methods of Minimal Acyclic FiniteState Automata for Large Dictionaries

» A Fast and Simple Algorithm for Constructing Minimal Acyclic Deterministic Finite Automata

» Transforming Lattices into Nondeterministic Automata with Optional Null Arcs

» Embedding Finite Automata within regular Expressions

» A New Parallel Multiplier for Type II Optimal Normal Basis

» The HOM problem is decidable

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	2002
Where	INFORMATICALT
Authors	Boris Melnikov, Alexandra Melnikova

Comments (0)