The following pages link to Janusz A. Brzozowski (Q722208):
Displayed 50 items.
- (Q443732) (redirect page) (← links)
- Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages (Q443735) (← links)
- Decision problems for convex languages (Q553302) (← links)
- On equations for regular languages, finite automata, and sequential networks (Q600253) (← links)
- Syntactic complexity of regular ideals (Q722210) (← links)
- On generalized locally testable languages (Q760215) (← links)
- Most complex deterministic union-free regular languages (Q777986) (← links)
- (Q1106811) (redirect page) (← links)
- An optimistic ternary simulation of gate races (Q1106812) (← links)
- Languages of R-trivial monoids (Q1146010) (← links)
- A generalization of finiteness (Q1236192) (← links)
- Run languages (Q1240067) (← links)
- The dot-depth hierarchy of star-free languages is infinite (Q1242697) (← links)
- Delay-insensitivity and ternary simulation (Q1575731) (← links)
- Automata of asynchronous behaviors (Q1575891) (← links)
- State complexity of overlap assembly (Q1616964) (← links)
- Quotient complexity of closed languages (Q1678754) (← links)
- Syntactic complexity of suffix-free languages (Q1706151) (← links)
- True concurrency in models of asynchronous circuit behavior (Q1870206) (← links)
- Hazard algebras (Q1878906) (← links)
- Quotient complexity of ideal languages (Q1935811) (← links)
- State complexity of single-word pattern matching in regular languages (Q2179329) (← links)
- State-complexity hierarchies of uniform languages of alphabet-size length (Q2271458) (← links)
- Predictable semiautomata (Q2271459) (← links)
- Most complex non-returning regular languages (Q2400992) (← links)
- Complexity of suffix-free regular languages (Q2402364) (← links)
- State complexity of pattern matching in regular languages (Q2422023) (← links)
- Theory of átomata (Q2453119) (← links)
- Representation of a class of nondeterministic semiautomata by canonical words. (Q2490807) (← links)
- Dot-depth of star-free events (Q2546343) (← links)
- Classification of noncounting events (Q2553949) (← links)
- General properties of star height of regular events (Q2555471) (← links)
- Characterizations of locally testable events (Q2558849) (← links)
- (Q2770665) (← links)
- (Q2776605) (← links)
- Quotient Complexities of Atoms in Regular Ideal Languages (Q2803047) (← links)
- (Q2819381) (← links)
- Unrestricted State Complexity of Binary Operations on Regular Languages (Q2829970) (← links)
- On the State Complexity of the Shuffle of Regular Languages (Q2829972) (← links)
- Universal Witnesses for State Complexity of Boolean Operations and Concatenation Combined with Star (Q2843082) (← links)
- Syntactic Complexity of ${\mathcal R}$ - and ${\mathcal J}$ -Trivial Regular Languages (Q2843093) (← links)
- ON THE COMPLEXITY OF THE EVALUATION OF TRANSIENT EXTENSIONS OF BOOLEAN FUNCTIONS (Q2909178) (← links)
- In Search of Most Complex Regular Languages (Q2914690) (← links)
- Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals (Q2921971) (← links)
- Complexity of Suffix-Free Regular Languages (Q2947876) (← links)
- (Q2965987) (← links)
- REPRESENTATION OF SEMIAUTOMATA BY CANONICAL WORDS AND EQUIVALENCES, PART II: SPECIFICATION OF SOFTWARE MODULES (Q3065617) (← links)
- CLOSURES IN FORMAL LANGUAGES AND KURATOWSKI'S THEOREM (Q3086240) (← links)
- Quotient Complexities of Atoms of Regular Languages (Q3167483) (← links)
- Syntactic Complexities of Some Classes of Star-Free Languages (Q3167576) (← links)