zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Techniques for establishing star height of regular sets. (English) Zbl 0218.94028
MSC:
68Q45Formal languages and automata
References:
[1]L. C. Eggan, Transition graphs and the star height of regular events,Michigan Math. J. 10 (1963), 385–397. · Zbl 0173.01504 · doi:10.1307/mmj/1028998975
[2]R. McNaughton, Techniques for manipulating regular expressions,Systems and Computer Sciences (J. F. Hart and S. Takasu, eds.), pp. 24–41, University of Toronto Press, Toronto, 1965.
[3]R. McNaughton, The loop complexity of regular events,Information Sci. 1 (1969), 305–328. · doi:10.1016/S0020-0255(69)80016-2
[4]R. McNaughton, The loop complexity of pure-group events,Information and Control 11 (1967), 167–176. · Zbl 0166.26905 · doi:10.1016/S0019-9958(67)90481-0
[5]R. McNaughton andH. Yamada, Regular expressions and state graphs for automata,IRE Trans. Electronics Computers EC-9 (1960), 39–57; also inSequential Machines: Selected Papers, (E. F. Moore, ed.), pp. 157–174, Addison-Wesley, Reading, Mass., 1963. · doi:10.1109/TEC.1960.5221603
[6]J. A. Brzozowski, Derivatives of regular expressions,J. Assoc. Comput. Math. 11 (1964), 481–494.
[7]J. A. Brzozowski andRina Cohen, on decompositions of regular events,J. Assoc. Comput. Mach. 16 (1969), 132–144.
[8]R. S. Cohen andJ. A. Brzozowski, General properties of star height of regular events,J. Comput. System Sci. 4 (1970), 260–280. · Zbl 0245.94038 · doi:10.1016/S0022-0000(70)80024-1
[9]R. S. Cohen, Star height of certain families of regular events,J. Comput. System Sci. 4 (1970), 281–297. · Zbl 0245.94039 · doi:10.1016/S0022-0000(70)80025-3
[10]R. S. Cohen, Rank-non-increasing transformations on transition graphs, to appear.
[11]R. S. Cohen, Cycle Rank of Transition Graphs and the Star Height of Regular Events, Ph.D. Dissertation, University of Ottawa, Ottawa, 1968.
[12]F. Dejean andM. P. Schützenberger, On a question of Eggan,Information and Control 9 (1966), 23–25. · Zbl 0209.02903 · doi:10.1016/S0019-9958(66)90083-0
[13]R. S. Cohen andJ. A. Brzozowski, On the star height of regular events,Proceedings of the Eighth Annual Symposium on Switching and Automata Theory, pp. 265–279, Inst. Elec. Electronics Eng., New York, 1967.
[14]R. S. Cohen, Transition graphs and the star height problem,Proceedings of the Ninth Annual Symposium on Switching and Automata Theory, pp. 383–394, Inst. Elec. Electronics Eng., New York, 1968.
[15]M. O. Rabin andD. Scott, Finite Automata and their Decision Problems.IBM J. Res. Develop. 3 (1959), 114–125. · doi:10.1147/rd.32.0114