/usr/include/mona/dfa.h is in mona 1.4-17-1+b1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 | /*
* MONA
* Copyright (C) 1997-2013 Aarhus University.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Suite 500, Boston, MA 02110-1335,
* USA.
*/
/* See the 'MONA User Manual' for documentation */
#ifndef __DFA_H
#define __DFA_H
#include "bdd.h"
enum astat {PRODUCT, PROJECT, MINIMIZATION};
typedef enum {
dfaIMPL = 11,
dfaBIIMPL = 9,
dfaAND = 8,
dfaOR = 14
} dfaProductType;
typedef struct {
bdd_manager *bddm; /* manager of BDD nodes */
int ns; /* number of states */
bdd_ptr *q; /* transition array */
int s; /* start state */
int *f; /* state statuses; -1:reject, 0:don't care, +1:accept */
} DFA;
extern int dfa_in_mem; /* number of automata currently in memory */
extern int max_dfa_in_mem; /* maximum number of automata in memory */
/* dfa.c */
DFA *dfaMake(int n);
DFA *dfaMakeNoBddm(int n);
void dfaFree(DFA *a);
void dfaNegation(DFA *a);
void dfaRestrict(DFA *a);
void dfaUnrestrict(DFA *a);
DFA *dfaCopy(DFA *a);
void dfaReplaceIndices(DFA *a, int map[]);
/* product.c */
DFA *dfaProduct(DFA *a1, DFA *a2, dfaProductType mode);
/* project.c */
DFA *dfaProject(DFA *a, unsigned index);
/* minimize.c */
DFA *dfaMinimize(DFA *a);
/* quotient.c */
void dfaRightQuotient(DFA *a, unsigned index);
/* prefix.c */
void dfaPrefixClose(DFA *a);
/* analyze.c */
char *dfaMakeExample(DFA *a, int kind, int num, unsigned indices[]);
void dfaAnalyze(DFA *a, int num, char *names[],
unsigned indices[], char orders[], int treestyle);
int dfaStatus(DFA *a);
/* makebasic.c */
void dfaSetup(int s, int len, int indices[]);
void dfaAllocExceptions(int n);
void dfaStoreException(int s, char *path);
void dfaStoreState(int s);
DFA *dfaBuild(char statuses[]);
/* printdfa.c */
void dfaPrintVitals(DFA *a);
void dfaPrint(DFA *a, int num, char *names[], unsigned indices[]);
void dfaPrintGraphviz(DFA *a, int num, unsigned indices[]);
void dfaPrintVerbose(DFA *a);
/* external.c */
int dfaExport(DFA *a, char *filename, int num, char *names[], char orders[]);
DFA* dfaImport(char *filename, char ***names, int **orders);
/* basic.c */
DFA *dfaTrue();
DFA *dfaFalse();
DFA *dfaSingleton(int i);
DFA *dfaEq2(int i, int j);
DFA *dfaSubset(int i, int j);
DFA *dfaEmpty(int i);
DFA *dfaPlus2(int i, int j);
DFA *dfaMinus2(int i, int j);
DFA *dfaUnion(int i, int j, int k);
DFA *dfaInter(int i, int j, int k);
DFA *dfaSetminus(int i, int j, int k);
DFA *dfaBoolvar(int b);
DFA *dfaIn(int i, int j);
DFA *dfaEq1(int i, int j);
DFA *dfaLastPos(int i);
DFA *dfaAllPos(int i);
DFA *dfaFirstOrder(int i);
DFA *dfaLess(int i, int j);
DFA *dfaLesseq(int i, int j);
DFA *dfaConst(int n, int i);
DFA *dfaPlus1(int i, int j, int n);
DFA *dfaMinus1(int i, int j);
DFA *dfaMax(int i, int j);
DFA *dfaMin(int i, int j);
DFA *dfaPlusModulo1(int i, int j, int k);
DFA *dfaMinusModulo1(int i, int j, int k);
DFA *dfaPresbConst(int i, int n);
#endif
|