Verwandte Artikel zu New Theoretical and Computational Results for Regular...
Zu dieser ISBN ist aktuell kein Angebot verfügbar.
Inhaltsangabe
Excerpt from New Theoretical and Computational Results for Regular Languages
A nondeterministic finite automata (abbr. Nfa) M is a 5-tuple F, where Q is a set of states, I g Q is the set of initial states, F g Q is the set of final states, and 6 C Q x (2 x Q) is a labeled directed graph with vertices Q and an edge labeled a connecting state q to state p for every p]] belonging to 6. For all q 6 Q and a 6 2 we use the notation b(q,a) to denote the set {p [q, E 6} of all statesreachable from state q by a single edge labeled a It is useful to generalize this notation with the following rules, where T C Q, s E E', and B C E.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
(Keine Angebote verfügbar)
Buch Finden: Kaufgesuch aufgebenSie finden Ihr gewünschtes Buch nicht? Wir suchen weiter für Sie. Sobald einer unserer Buchverkäufer das Buch bei AbeBooks anbietet, werden wir Sie informieren!
Kaufgesuch aufgeben
