SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Robert Knast: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

Robert Knast, Jacek Martinek
Reading Functions and an Extension of Kleene Theorem for some Families of Languages. [Citation Graph (0, 0)][DBLP]
FCT, 1977, pp:127-134 [Conf]
Robert Knast
Semigroup Characterizations of Some Language Varieties. [Citation Graph (0, 0)][DBLP]
MFCS, 1976, pp:395-403 [Conf]
Robert Knast
Linear Probabilistic Sequential Machines [Citation Graph (0, 0)][DBLP]
Information and Control, 1969, v:15, n:2, pp:111-129 [Journal]
Robert Knast
Continuous-Time Probabilistic Automata [Citation Graph (0, 0)][DBLP]
Information and Control, 1969, v:15, n:4, pp:335-352 [Journal]
Robert Knast
Representability of Nonregular Languages in Finite Probabilistic Automata [Citation Graph (0, 0)][DBLP]
Information and Control, 1970, v:16, n:3, pp:285-302 [Journal]
Robert Knast
Finite-State Probabilistic Languages [Citation Graph (0, 0)][DBLP]
Information and Control, 1972, v:21, n:2, pp:148-170 [Journal]
Janusz A. Brzozowski, Robert Knast
Graph Congruences and Pair Testing. [Citation Graph (0, 0)][DBLP]
ITA, 1986, v:20, n:2, pp:129-147 [Journal]
Robert Knast
A Semigroup Characterization of Dot-Depth one Languages. [Citation Graph (0, 0)][DBLP]
ITA, 1983, v:17, n:4, pp:321-330 [Journal]
Robert Knast
Some Theorems on Graph Congruences. [Citation Graph (0, 0)][DBLP]
ITA, 1983, v:17, n:4, pp:331-342 [Journal]
Janusz A. Brzozowski, Robert Knast
The Dot-Depth Hierarchy of Star-Free Languages is Infinite. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1978, v:16, n:1, pp:37-55 [Journal]

Search in 0.001secs, Finished in 0.002secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP