Results 1 
6 of
6
Janusz Brzozowski Syntactic Complexity of Regular Languages Syntactic Complexity Languages with Special Quotients Ideals and Closed Languages
, 2011
"... Alphabet Σ a finite set of letters Set of all words Σ ∗ free monoid generated by Σ Set of nonempty words Σ+ free semigroup generated by Σ Empty word ε Language L ⊆ Σ∗ The εfunction Lε of a regular language L Lε = { ∅, if ε 6 ∈ L; {ε}, if ε ∈ L. ..."
Abstract
 Add to MetaCart
Alphabet Σ a finite set of letters Set of all words Σ ∗ free monoid generated by Σ Set of nonempty words Σ+ free semigroup generated by Σ Empty word ε Language L ⊆ Σ∗ The εfunction Lε of a regular language L Lε = { ∅, if ε 6 ∈ L; {ε}, if ε ∈ L.
Partial Derivatives of Regular Expressions and Finite Automata Constructions
 Theoretical Computer Science
, 1995
"... . We introduce a notion of a partial derivative of a regular expression. It is a generalization to the nondeterministic case of the known notion of a derivative invented by Brzozowski. We give a constructive definition of partial derivatives, study their properties, and employ them to develop a new ..."
Abstract

Cited by 98 (0 self)
 Add to MetaCart
new algorithm for turning regular expressions into relatively small NFA and to provide certain improvements to Brzozowski's algorithm constructing DFA. We report on a prototype implementation of our algorithm constructing NFA and present some examples. Introduction In 1964 Janusz Brzozowski
Regularexpression derivatives reexamined
"... The derivative of a set of strings S with respect to a symbol a is the set of strings generated by stripping the leading a from the strings in S that start with a. For regular sets of strings, i.e., sets defined by regular expressions (REs), the derivative is also a regular set. In a 1964 paper, Jan ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
, Janusz Brzozowski presented an elegant method for directly constructing a
unknown title
"... Representation of a class of nondeterministic semiautomata by canonical words Janusz. A. Brzozowski∗ ..."
Abstract
 Add to MetaCart
Representation of a class of nondeterministic semiautomata by canonical words Janusz. A. Brzozowski∗
unknown title
"... Languages convex with respect to binary relations, and their closure properties∗ Thomas Ang † and Janusz Brzozowski† A language is prefixconvex if it satisfies the condition that, if a word w and its prefix u are in the language, then so is every prefix of w that has u as a prefix. Prefixconvex la ..."
Abstract
 Add to MetaCart
Languages convex with respect to binary relations, and their closure properties∗ Thomas Ang † and Janusz Brzozowski† A language is prefixconvex if it satisfies the condition that, if a word w and its prefix u are in the language, then so is every prefix of w that has u as a prefix. Prefix
unknown title
"... Languages convex with respect to binary relations, and their closure properties∗ Thomas Ang † and Janusz Brzozowski† A language is prefixconvex if it satisfies the condition that, if a word w and its prefix u are in the language, then so is every prefix of w that has u as a prefix. Prefixconvex la ..."
Abstract
 Add to MetaCart
Languages convex with respect to binary relations, and their closure properties∗ Thomas Ang † and Janusz Brzozowski† A language is prefixconvex if it satisfies the condition that, if a word w and its prefix u are in the language, then so is every prefix of w that has u as a prefix. Prefix