-
1
-
-
0004190197
-
-
Addison-Wesley, Reading, MA
-
A. V. Aho, J. E. Hopcroft and J. D. Ullman, Data Structures and Algorithms, Addison-Wesley, Reading, MA, 1983.
-
(1983)
Data Structures and Algorithms
-
-
Aho, A.V.1
Hopcroft, J.E.2
Ullman, J.D.3
-
2
-
-
0347349510
-
Dérivations Formelles des Expressions Rationnelles: Un Programme de Calcul Automatique
-
J.-M. Autebert and J.-M. Rifflet, Dérivations Formelles des Expressions Rationnelles: Un Programme de Calcul Automatique, Rapport LITP 78(14), 1978.
-
(1978)
Rapport LITP
, vol.78
, Issue.14
-
-
Autebert, J.-M.1
Rifflet, J.-M.2
-
3
-
-
0030110111
-
Partial derivatives of regular expressions and finite automaton constructions
-
V. Antimirov, Partial derivatives of regular expressions and finite automaton constructions, Theoret. Comput. Sci. 155 (1996), 291-319.
-
(1996)
Theoret. Comput. Sci.
, vol.155
, pp. 291-319
-
-
Antimirov, V.1
-
5
-
-
0027694328
-
Regular Expressions into Finite Automata
-
A. Brüggemann-Klein, Regular Expressions into Finite Automata, Theoret. Comput. Sci. 120 (1993), 197-213.
-
(1993)
Theoret. Comput. Sci.
, vol.120
, pp. 197-213
-
-
Brüggemann-Klein, A.1
-
6
-
-
0022989344
-
From regular expressions to deterministic automata
-
G. Berry and R. Sethi, From regular expressions to deterministic automata, Theoret. Comput. Sci. 48(1) (1986), 117-126.
-
(1986)
Theoret. Comput. Sci.
, vol.48
, Issue.1
, pp. 117-126
-
-
Berry, G.1
Sethi, R.2
-
7
-
-
84945709734
-
Derivatives of regular expressions
-
J. A. Brzozowski, Derivatives of regular expressions, J. Assoc. Comput. Mach. 11(4) (1964), 481-494.
-
(1964)
J. Assoc. Comput. Mach.
, vol.11
, Issue.4
, pp. 481-494
-
-
Brzozowski, J.A.1
-
8
-
-
85029508976
-
From Regular Expressions to DFAs Using Compressed NFA's
-
eds. A. Apostolico, M. Crochemore, Z. Galil and U. Manber
-
C.-H. Chang and R. Paige, From Regular Expressions to DFAs Using Compressed NFA's, eds. A. Apostolico, M. Crochemore, Z. Galil and U. Manber, Lecture Notes in Computer Science 644 (1992), 88-108.
-
(1992)
Lecture Notes in Computer Science
, vol.644
, pp. 88-108
-
-
Chang, C.-H.1
Paige, R.2
-
11
-
-
0346088420
-
New Finite Automaton Constructions Based on Canonical Derivatives
-
ed. S. Yu, Notes in Computer Science, to appear
-
J.-M. Champarnaud and D. Ziadi, New Finite Automaton Constructions Based on Canonical Derivatives, ed. S. Yu, Lecture Notes in Computer Science, Proc. CIAA'2000, to appear.
-
(2000)
Proc. CIAA'2000
-
-
Champarnaud, J.-M.1
Ziadi, D.2
-
12
-
-
0002833962
-
The abstract theory of automata
-
V. M. Glushkov, The abstract theory of automata, Russ. Math. Surv. 16 (1961), 1-53.
-
(1961)
Russ. Math. Surv.
, vol.16
, pp. 1-53
-
-
Glushkov, V.M.1
-
13
-
-
0003620778
-
-
Addison-Wesley, Reading, MA
-
J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 1979.
-
(1979)
Introduction to Automata Theory, Languages and Computation
-
-
Hopcroft, J.E.1
Ullman, J.D.2
-
14
-
-
0003067817
-
Representation of events in nerve nets and finite automata, automata studies
-
Princeton University Press
-
S. Kleene, Representation of events in nerve nets and finite automata, automata studies, Ann. Math. Stud., Princeton University Press 34 (1956), 3-41.
-
(1956)
Ann. Math. Stud.
, vol.34
, pp. 3-41
-
-
Kleene, S.1
-
16
-
-
0010632405
-
An algorithm for constructing a base in a language of regular expressions
-
B. G. Mirkin, An algorithm for constructing a base in a language of regular expressions, Eng. Cybern. 5 (1966), 110-116.
-
(1966)
Eng. Cybern.
, vol.5
, pp. 110-116
-
-
Mirkin, B.G.1
-
17
-
-
0023566630
-
Three partition refinement algorithms
-
R. Paige and R. E. Tarjan, Three partition refinement algorithms, SIAM J. Comput. 16(6) (1987), 973-989.
-
(1987)
SIAM J. Comput.
, vol.16
, Issue.6
, pp. 973-989
-
-
Paige, R.1
Tarjan, R.E.2
-
18
-
-
84959065016
-
A new Quadratic Algorithm to Convert a Regular Expression into an Automaton
-
eds. D. Raymond and D. Wood, Proc. WIA'96
-
J.-L. Ponty, D. Ziadi and J.-M. Champarnaud, A new Quadratic Algorithm to Convert a Regular Expression into an Automaton, eds. D. Raymond and D. Wood, Lecture Notes in Computer Science 1260, Proc. WIA'96 (1997), 109-110.
-
(1997)
Lecture Notes in Computer Science
, vol.1260
, pp. 109-110
-
-
Ponty, J.-L.1
Ziadi, D.2
Champarnaud, J.-M.3
-
19
-
-
0002700117
-
Regular languages, Handbook of Formal Languages
-
eds. G. Rozenberg and A. Salomaa, Springer-Verlag
-
S. Yu, Regular languages, Handbook of Formal Languages, in Word, Language, Grammar, eds. G. Rozenberg and A. Salomaa, Springer-Verlag 1, 1997, pp. 41-110.
-
(1997)
Word, Language, Grammar
, vol.1
, pp. 41-110
-
-
Yu, S.1
-
20
-
-
0000516784
-
Passage d'une expression rationnelle á un automate fini non-déterministe
-
D. Ziadi, J.-L. Ponty and J.-M. Champarnaud, Passage d'une expression rationnelle á un automate fini non-déterministe, Bull. Belg. Math. Soc. 4 (1997), 177-203.
-
(1997)
Bull. Belg. Math. Soc.
, vol.4
, pp. 177-203
-
-
Ziadi, D.1
Ponty, J.-L.2
Champarnaud, J.-M.3
|