-
1
-
-
34548072750
-
3-Party Message Complexity is Better than 2-Party Ones for Proving Lower Bounds on the Size of Minimal Nondeterministic Finite Automata
-
Adorna, H.N.: 3-Party Message Complexity is Better than 2-Party Ones for Proving Lower Bounds on the Size of Minimal Nondeterministic Finite Automata. J. Autom. Lang. Comb. 7, 419-432 (2002)
-
(2002)
J. Autom. Lang. Comb
, vol.7
, pp. 419-432
-
-
Adorna, H.N.1
-
2
-
-
0020937092
-
On notions of informations transfer in VLSI circuits
-
ACM, New York
-
Aho, A.V., Ullman, J.D., Yannakakis, M.: On notions of informations transfer in VLSI circuits. In: Proc.15th ACM STOC, pp. 133-139. ACM, New York (1983)
-
(1983)
Proc.15th ACM STOC
, pp. 133-139
-
-
Aho, A.V.1
Ullman, J.D.2
Yannakakis, M.3
-
3
-
-
0004072128
-
On the complexity of regular languages in terms of finite automata
-
Technical Report 304, Polish Academy of Sciences
-
Berman, P., Lingas, A.: On the complexity of regular languages in terms of finite automata. Technical Report 304, Polish Academy of Sciences (1977)
-
(1977)
-
-
Berman, P.1
Lingas, A.2
-
4
-
-
0000392751
-
Intersection and union of regular languages and state complexity
-
Birget, J.C.: Intersection and union of regular languages and state complexity. Inform. Process. Lett. 43, 185-190 (1992)
-
(1992)
Inform. Process. Lett
, vol.43
, pp. 185-190
-
-
Birget, J.C.1
-
5
-
-
0027685116
-
Partial orders on words, minimal elements of regular languages, and state complexity
-
Birget, J.C.: Partial orders on words, minimal elements of regular languages, and state complexity. Theoret. Comput. Sci. 119, 267-291 (1993)
-
(1993)
Theoret. Comput. Sci
, vol.119
, pp. 267-291
-
-
Birget, J.C.1
-
6
-
-
0022863896
-
Finite automata and unary languages
-
Chrobak, M.: Finite automata and unary languages. Theoret. Comput. Sci. 47, 149-158 (1986)
-
(1986)
Theoret. Comput. Sci
, vol.47
, pp. 149-158
-
-
Chrobak, M.1
-
7
-
-
84905821970
-
-
Nondeterminism and the size of one-way finite automata
-
Geffert, V. (Non)determinism and the size of one-way finite automata. In: Proc. 7th DCFS, Como, Italy, pp. 23-37 (2006)
-
(2006)
Proc. 7th DCFS, Como, Italy
, pp. 23-37
-
-
Geffert, V.1
-
8
-
-
33750061594
-
-
Geffert, V.: Magic numbers in the state hierarchy of finite automata. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, 4162, pp. 412-423. Springer, Heidelberg (2006)
-
Geffert, V.: Magic numbers in the state hierarchy of finite automata. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 412-423. Springer, Heidelberg (2006)
-
-
-
-
9
-
-
11844290244
-
A lower bound technique for the size of nondeterministic finite automata
-
Glaister, I., Shallit, J.: A lower bound technique for the size of nondeterministic finite automata. Inform. Process. Lett. 59, 75-77 (1996)
-
(1996)
Inform. Process. Lett
, vol.59
, pp. 75-77
-
-
Glaister, I.1
Shallit, J.2
-
11
-
-
11844274041
-
Descriptional complexity of finite automata: Concepts and open problems
-
Hromkovič, J.: Descriptional complexity of finite automata: concepts and open problems. J. Autom. Lang. Comb. 7, 519-531 (2002)
-
(2002)
J. Autom. Lang. Comb
, vol.7
, pp. 519-531
-
-
Hromkovič, J.1
-
12
-
-
0037192366
-
Communication complexity method for measuring nondeterminism in finite automata
-
Hromkovič, J., Seibert, S., Karhumäki, J., Klauck, H., Schnitger, G.: Communication complexity method for measuring nondeterminism in finite automata. Inform. and Comput. 172, 202-217 (2002)
-
(2002)
Inform. and Comput
, vol.172
, pp. 202-217
-
-
Hromkovič, J.1
Seibert, S.2
Karhumäki, J.3
Klauck, H.4
Schnitger, G.5
-
13
-
-
0038212248
-
Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs
-
Iwama, K., Kambayashi, Y., Takaki, K.: Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs. Theoret. Comput. Sci. 237, 485-494 (2000)
-
(2000)
Theoret. Comput. Sci
, vol.237
, pp. 485-494
-
-
Iwama, K.1
Kambayashi, Y.2
Takaki, K.3
-
15
-
-
84974715462
-
-
Jirásková, G.: Note on minimal finite automata. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, 2136, pp. 421-431. Springer, Heidelberg (2001)
-
Jirásková, G.: Note on minimal finite automata. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 421-431. Springer, Heidelberg (2001)
-
-
-
-
16
-
-
11844255667
-
State complexity of some operations on binary regular languages
-
Jirásková, G.: State complexity of some operations on binary regular languages. Theoret. Comput. Sci. 330, 287-298 (2005)
-
(2005)
Theoret. Comput. Sci
, vol.330
, pp. 287-298
-
-
Jirásková, G.1
-
17
-
-
11844258994
-
A comparison of two types of finite automata
-
in Russian
-
Lupanov, O.B.: A comparison of two types of finite automata. Problemy Kibernetiki 9, 321-326 (in Russian) (1963)
-
(1963)
Problemy Kibernetiki
, vol.9
, pp. 321-326
-
-
Lupanov, O.B.1
-
18
-
-
0345753004
-
Estimates for optimal determinization of nondeterministic autonomous automata
-
in Russian
-
Lyubich, Y.I.: Estimates for optimal determinization of nondeterministic autonomous automata. Sibirskii Matematichskii Zhurnal 5, 337-355 (in Russian) (1964)
-
(1964)
Sibirskii Matematichskii Zhurnal
, vol.5
, pp. 337-355
-
-
Lyubich, Y.I.1
-
19
-
-
0015145078
-
On the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic, and two-way finite automata
-
Moore, F.R.: On the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic, and two-way finite automata. IEEE Trans. Comput. 20, 1211-1214 (1971)
-
(1971)
IEEE Trans. Comput
, vol.20
, pp. 1211-1214
-
-
Moore, F.R.1
-
20
-
-
0000973916
-
Finite automata and their decision problems
-
Rabin, M., Scott, D.: Finite automata and their decision problems. IBM Res. Develop. 3, 114-129 (1959)
-
(1959)
IBM Res. Develop
, vol.3
, pp. 114-129
-
-
Rabin, M.1
Scott, D.2
-
23
-
-
0002700117
-
Regular languages
-
Rozenberg, G, Salomaa, A, eds, ch. 2, pp, Springer-Verlag, Berlin Heidelberg
-
Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. I, ch. 2, pp. 41-110. Springer-Verlag, Berlin Heidelberg (1997)
-
(1997)
Handbook of Formal Languages
, vol.1
, pp. 41-110
-
-
Yu, S.1
|