Janusz A. Brzozowski

From MaRDI portal
Person:722208

Available identifiers

zbMath Open brzozowski.janusz-aWikidataQ6155997 ScholiaQ6155997MaRDI QIDQ722208

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q49949412021-06-22Paper
State Complexity of Overlap Assembly2021-04-19Paper
https://portal.mardi4nfdi.de/entity/Q49640072021-02-24Paper
https://portal.mardi4nfdi.de/entity/Q51465122021-01-26Paper
Most complex deterministic union-free regular languages2020-06-30Paper
State complexity of single-word pattern matching in regular languages2020-05-12Paper
Most Complex Non-Returning Regular Languages2019-12-10Paper
Complexity of proper prefix-convex regular languages2019-08-20Paper
State complexity of pattern matching in regular languages2019-06-18Paper
State complexity of overlap assembly2018-11-07Paper
https://portal.mardi4nfdi.de/entity/Q53763312018-09-17Paper
On the delay-sensitivity of gate networks2018-09-14Paper
Syntactic complexity of regular ideals2018-07-23Paper
https://portal.mardi4nfdi.de/entity/Q46093272018-03-29Paper
Syntactic complexity of suffix-free languages2018-03-21Paper
Quotient complexity of closed languages2017-11-07Paper
Complexity of suffix-free regular languages2017-09-07Paper
Most complex non-returning regular languages2017-08-31Paper
Complexity of Right-Ideal, Prefix-Closed, and Prefix-Free Regular Languages2017-08-25Paper
Complexity of proper prefix-convex regular languages2017-08-22Paper
Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages2017-06-01Paper
https://portal.mardi4nfdi.de/entity/Q29659872017-03-03Paper
Unrestricted State Complexity of Binary Operations on Regular Languages2016-11-09Paper
On the State Complexity of the Shuffle of Regular Languages2016-11-09Paper
https://portal.mardi4nfdi.de/entity/Q28193812016-09-29Paper
https://portal.mardi4nfdi.de/entity/Q57404172016-07-26Paper
Quotient Complexities of Atoms in Regular Ideal Languages2016-05-03Paper
Large Aperiodic Semigroups2016-02-17Paper
Complexity of Suffix-Free Regular Languages2015-09-29Paper
Upper Bound on Syntactic Complexity of Suffix-Free Languages2015-08-07Paper
https://portal.mardi4nfdi.de/entity/Q51784492015-03-16Paper
SYNTACTIC COMPLEXITY OF ℛ- AND đ’„-TRIVIAL REGULAR LANGUAGES2015-02-09Paper
Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals2014-10-14Paper
Large Aperiodic Semigroups2014-09-26Paper
Most Complex Regular Right-Ideal Languages2014-08-07Paper
COMPLEXITY OF ATOMS OF REGULAR LANGUAGES2014-08-04Paper
Symmetric Groups and Quotient Complexity of Boolean Operations2014-07-01Paper
Theory of ĂĄtomata2014-06-06Paper
IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES2014-03-10Paper
Universal Witnesses for State Complexity of Boolean Operations and Concatenation Combined with Star2013-08-09Paper
Syntactic Complexity of ${\mathcal R}$ - and ${\mathcal J}$ -Trivial Regular Languages2013-08-09Paper
Universal Witnesses for State Complexity of Basic Operations Combined with Reversal2013-08-07Paper
QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES2013-06-06Paper
Quotient complexity of ideal languages2013-02-19Paper
Quotient Complexities of Atoms of Regular Languages2012-11-02Paper
Syntactic Complexities of Some Classes of Star-Free Languages2012-11-02Paper
In Search of Most Complex Regular Languages2012-09-20Paper
ON THE COMPLEXITY OF THE EVALUATION OF TRANSIENT EXTENSIONS OF BOOLEAN FUNCTIONS2012-08-30Paper
Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages2012-08-13Paper
https://portal.mardi4nfdi.de/entity/Q53892832012-04-26Paper
Theory of Átomata2011-07-29Paper
Syntactic Complexity of Ideal and Closed Languages2011-07-29Paper
Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages2011-07-29Paper
Decision problems for convex languages2011-07-27Paper
CLOSURES IN FORMAL LANGUAGES AND KURATOWSKI'S THEOREM2011-03-30Paper
REPRESENTATION OF SEMIAUTOMATA BY CANONICAL WORDS AND EQUIVALENCES, PART II: SPECIFICATION OF SOFTWARE MODULES2011-01-06Paper
Quotient complexity of closed languages2010-06-22Paper
Complexity in Convex Languages2010-05-26Paper
Quotient Complexity of Ideal Languages2010-04-27Paper
https://portal.mardi4nfdi.de/entity/Q53061702010-04-08Paper
State-complexity hierarchies of uniform languages of alphabet-size length2009-08-07Paper
Predictable semiautomata2009-08-07Paper
Closures in Formal Languages and Kuratowski’s Theorem2009-07-07Paper
Decision Problems for Convex Languages2009-04-02Paper
COVERING OF TRANSIENT SIMULATION OF FEEDBACK-FREE CIRCUITS BY BINARY ANALYSIS2006-08-21Paper
Representation of a class of nondeterministic semiautomata by canonical words.2006-05-18Paper
REPRESENTATION OF SEMIAUTOMATA BY CANONICAL WORDS AND EQUIVALENCES2005-11-14Paper
SIMULATION OF FEEDBACK-FREE CIRCUITS IN THE ALGEBRA OF TRANSIENTS2005-10-19Paper
INVOLUTED SEMILATTICES AND UNCERTAINTY IN TERNARY ALGEBRAS2005-09-27Paper
Gate circuits in the algebra of transients2005-06-07Paper
Theory Is Forever2005-01-18Paper
Hazard algebras2004-09-09Paper
https://portal.mardi4nfdi.de/entity/Q44504382004-02-15Paper
https://portal.mardi4nfdi.de/entity/Q44185982003-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44186042003-08-11Paper
True concurrency in models of asynchronous circuit behavior2003-05-11Paper
A CHARACTERIZATION OF de MORGAN ALGEBRAS2002-12-15Paper
https://portal.mardi4nfdi.de/entity/Q27766052002-02-28Paper
https://portal.mardi4nfdi.de/entity/Q27706652002-02-13Paper
https://portal.mardi4nfdi.de/entity/Q49411432000-09-26Paper
Automata of asynchronous behaviors2000-08-23Paper
Delay-insensitivity and ternary simulation2000-08-21Paper
Generalized ternary simulation of sequential circuits1997-10-30Paper
https://portal.mardi4nfdi.de/entity/Q43480021997-08-12Paper
https://portal.mardi4nfdi.de/entity/Q48848841996-07-08Paper
https://portal.mardi4nfdi.de/entity/Q39712591992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39712741992-06-25Paper
Consistency and satisfiability of waveform timing specifications1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33529651989-01-01Paper
A unified framework for race analysis of asynchronous networks1989-01-01Paper
An optimistic ternary simulation of gate races1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37808971987-01-01Paper
A Characterization of Ternary Simulation of Gate Networks1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37260201986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37278721986-01-01Paper
Graph congruences and pair testing1986-01-01Paper
On serializability1985-01-01Paper
On generalized locally testable languages1984-01-01Paper
On equations for regular languages, finite automata, and sequential networks1980-01-01Paper
Languages of R-trivial monoids1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38868891980-01-01Paper
On a Ternary Model of Gate Networks1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41995601979-01-01Paper
The dot-depth hierarchy of star-free languages is infinite1978-01-01Paper
A generalization of finiteness1977-01-01Paper
Run languages1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41411101977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40669951975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40986691975-01-01Paper
Characterizations of locally testable events1973-01-01Paper
On Translation Algorithms in Residue Number Systems1972-01-01Paper
About Feedback and SR Flip-Flops1971-01-01Paper
Dot-depth of star-free events1971-01-01Paper
Classification of noncounting events1971-01-01Paper
General properties of star height of regular events1970-01-01Paper
Sign Detection in Residue Number Systems1969-01-01Paper
On Decompositions of Regular Events1969-01-01Paper
Definite Asynchronous Sequential Circuits1968-01-01Paper
On single-loop realizations of sequential machines1967-01-01Paper
Roots of Star Events1967-01-01Paper
A Diagrammatic Approach to Multilevel Logic Synthesis1965-01-01Paper
Derivatives of Regular Expressions1964-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57259921963-01-01Paper
Boolean Matrices and the Stability of Neural Nets1963-01-01Paper
A Survey of Regular Expressions and Their Applications1962-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Janusz A. Brzozowski