Janusz A. Brzozowski

Theor. Comput. Sci., 2019

State complexity of pattern matching in regular languages.

[BibT_eX]

[DOI]

Abhishek Madan

Theor. Comput. Sci., 2019

Most Complex Non-Returning Regular Languages.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2019

State Complexity of Single-Word Pattern Matching in Regular Languages.

[BibT_eX]

[DOI]

Abhishek Madan

Proceedings of the Descriptional Complexity of Formal Systems, 2019

2018

Use Cases for IPv6 Source Packet Routing in Networking (SPRING).

[BibT_eX]

[DOI]

RFC, March, 2018

Syntactic Complexity of Regular Ideals.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2018

Towards a Theory of Complexity of Regular Languages.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2018

Syntactic complexity of suffix-free languages.

[BibT_eX]

[DOI]

Inf. Comput., 2018

State Complexity of Pattern Matching in Finite Automata.

[BibT_eX]

[DOI]

Abhishek Madan

CoRR, 2018

Most Complex Deterministic Union-Free Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2018

2017

Complexity of suffix-free regular languages.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

Unrestricted State Complexity of Binary Operations on Regular and Ideal Languages.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2017

Complexity of Right-Ideal, Prefix-Closed, and Prefix-Free Regular Languages.

[BibT_eX]

[DOI]

Acta Cybern., 2017

Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2017

2016

Most Complex Regular Ideal Languages.

[BibT_eX]

[DOI]

Bo Yang Victor Liu

Discret. Math. Theor. Comput. Sci., 2016

Complexity of Prefix-Convex Regular Languages.

[BibT_eX]

[DOI]

CoRR, 2016

True State Complexity of Binary Operations on Regular Languages.

[BibT_eX]

[DOI]

CoRR, 2016

Modeling and performance simulation of a software architecture for large-scale measurement of broadband networks using colored petri nets.

[BibT_eX]

[DOI]

Vijay Gehlot

Sarvesh S. Kulkarni

John Brzozowski

Proceedings of the 19th Communications & Networking Symposium, 2016

On the State Complexity of the Shuffle of Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2016

Unrestricted State Complexity of Binary Operations on Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2016

2015

Large Aperiodic Semigroups.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2015

Most Complex Regular Ideals.

[BibT_eX]

[DOI]

Bo Yang Victor Liu

CoRR, 2015

Quotient Complexities of Atoms in Regular Ideal Languages.

[BibT_eX]

[DOI]

Acta Cybern., 2015

Upper Bound on Syntactic Complexity of Suffix-Free Languages.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2015

A scalable architecture for performance measurement in broadband networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE Conference on Standards for Communications and Networking, 2015

2014

Theory of átomata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Quotient Complexity of Closed Languages.

[BibT_eX]

[DOI]

Galina Jirásková

Chenglong Zou

Theory Comput. Syst., 2014

Syntactic Complexity of ℛ- and 풥-Trivial Regular Languages.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2014

Maximally Atomic Languages.

[BibT_eX]

[DOI]

Gareth Davies

Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Languages.

[BibT_eX]

[DOI]

Acta Cybern., 2014

Symmetric Groups and Quotient Complexity of Boolean Operations.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 18th International Conference, 2014

Most Complex Regular Right-Ideal Languages.

[BibT_eX]

[DOI]

Gareth Davies

Proceedings of the Descriptional Complexity of Formal Systems, 2014

2013

Quotient complexity of ideal languages.

[BibT_eX]

[DOI]

Galina Jirásková

Theor. Comput. Sci., 2013

Complexity of atoms of Regular Languages.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2013

In Search of Most Complex Regular Languages.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2013

Maximal Syntactic Complexity of Regular Languages Implies Maximal Quotient Complexities of Atoms

[BibT_eX]

[DOI]

Gareth Davies

CoRR, 2013

Minimal Nondeterministic Finite Automata and Atoms of Regular Languages

[BibT_eX]

[DOI]

CoRR, 2013

Universal Witnesses for State Complexity of Basic Operations Combined with Reversal.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2013

Syntactic Complexity of - and -Trivial Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2013

Universal Witnesses for State Complexity of Boolean Operations and Concatenation Combined with Star.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2013

2012

Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Syntactic Complexities of Six Classes of Star-Free Languages.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2012

On the Complexity of the Evaluation of Transient Extensions of Boolean Functions.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2012

Quotient Complexity of Star-Free Languages.

[BibT_eX]

[DOI]

Bo Liu

Int. J. Found. Comput. Sci., 2012

Syntactic Complexity of R- and J-Trivial Regular Languages

[BibT_eX]

[DOI]

CoRR, 2012

Syntactic Complexity of Finite/Cofinite, Definite, and Reverse Definite Languages

[BibT_eX]

[DOI]

CoRR, 2012

Quotient Complexities of Atoms of Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 16th International Conference, 2012

Syntactic Complexities of Some Classes of Star-Free Languages.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2012

2011

Closures in Formal Languages and Kuratowski's Theorem.

[BibT_eX]

[DOI]

Elyot Grant

Jeffrey O. Shallit

Int. J. Found. Comput. Sci., 2011

Decision problems for convex languages.

[BibT_eX]

[DOI]

Jeffrey O. Shallit

Zhi Xu

Inf. Comput., 2011

Syntactic Complexity of Star-Free Languages

[BibT_eX]

[DOI]

CoRR, 2011

Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Languages

[BibT_eX]

[DOI]

CoRR, 2011

Syntactic Complexity of Ideal and Closed Languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2011

2010

Gate Circuits with Feedback in Finite Multivalued Algebras of Transients.

[BibT_eX]

[DOI]

J. Multiple Valued Log. Soft Comput., 2010

Quotient Complexity of Bifix-, Factor-, and Subword-Free Languages

[BibT_eX]

[DOI]

Galina Jirásková

Joshua Smith

CoRR, 2010

Complexity in Convex Languages.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2010

2009

Predictable semiautomata.

[BibT_eX]

[DOI]

Nicolae Santean

Theor. Comput. Sci., 2009

State-complexity hierarchies of uniform languages of alphabet-size length.

[BibT_eX]

[DOI]

Stavros Konstantinidis

Theor. Comput. Sci., 2009

Quotient Complexity of Regular Languages

[BibT_eX]

[DOI]

Proceedings of the Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, 2009

Closures in Formal Languages: Concatenation, Separation, and Algorithms

[BibT_eX]

[DOI]

Elyot Grant

Jeffrey O. Shallit

CoRR, 2009

Languages Convex with Respect to Binary Relations, and Their Closure Properties.

[BibT_eX]

[DOI]

Thomas Ang

Acta Cybern., 2009

2008

Determinism without Determinization.

[BibT_eX]

Nicolae Santean

Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

Continuous Languages.

[BibT_eX]

Thomas Ang

Proceedings of the Automata and Formal Languages, 12th International Conference, 2008

2007

Representation of Semiautomata by Canonical Words and Equivalences, Part II: Specification of Software Modules.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2007

Simulation of Gate Circuits with Feedback in Multi-Valued Algebras.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Multiple-Valued Logic, 2007

2006

Topics in Asynchronous Circuit Theory.

[BibT_eX]

[DOI]

Proceedings of the Recent Advances in Formal Languages and Applications, 2006

Representation of a class of nondeterministic semiautomata by canonical words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Covering of Transient Simulation of Feedback-free Circuits by Binary Analysis.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2006

Errata: "representation of Semiautomata by Canonical Words and Equivalences".

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2006

2005

Gate circuits in the algebra of transients.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2005

Representation of semiautomata by canonical words and equivalences.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

2004

Involuted Semilattices and Uncertainty in Ternary Algebras.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2004

Duality for Three: Ternary Symmetry in Process Spaces.

[BibT_eX]

[DOI]

Proceedings of the Theory Is Forever, 2004

2003

Decomposition of Boolean Functions Specified by Cubes.

[BibT_eX]

[DOI]

Tadeusz Luba

J. Multiple Valued Log. Soft Comput., 2003

Simulation Of Feedback-Free Circuits In The Algebra Of Transients.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2003

True Concurrency in Models of Asynchronous Circuit Behavior.

[BibT_eX]

[DOI]

Signe J. Silver

Formal Methods Syst. Des., 2003

Hazard Algebras.

[BibT_eX]

[DOI]

Zoltán Ésik

Formal Methods Syst. Des., 2003

2002

A framework for testing special-purpose memories.

[BibT_eX]

[DOI]

Piotr R. Sidorowicz

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2002

Feedback-Free Circuits in the Algebra of Transients.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2002

Simulation of Gate Circuits in the Algebra of Transients.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2002

2001

A Characterization of De Morgan Algebras.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2001

Algebras for Hazard Detection.

[BibT_eX]

[DOI]

Zoltán Ésik

Y. Iland

Proceedings of the 31st IEEE International Symposium on Multiple-Valued Logic, 2001

2000

Automata of Asynchronous Behaviors.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Delay-insensitivity and ternary simulation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Delay-Insensitivity and Semi-Modularity.

[BibT_eX]

[DOI]

Hao Zhang

Formal Methods Syst. Des., 2000

De Morgan Bisemilattices.

[BibT_eX]

[DOI]

Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic, 2000

Hazard Algebras (Extended Abstract).

[BibT_eX]

Zoltán Ésik

Proceedings of the A Half-Century of Automata Theory: Celebration and Inspiration, 2000

1999

Erratum to An Algebra of Multiple Faults in RAMs.

[BibT_eX]

[DOI]

J. Electron. Test., 1999

A Characterization of Signed Hypergraphs and Its Applications to VLSI Via Minimization and Logic Synthesis.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

A Generalization of Shestakov's Function Decomposition Method.

[BibT_eX]

[DOI]

J. J. Lou

Proceedings of the 29th IEEE International Symposium on Multiple-Valued Logic, 1999

Semilattices of Fault Semiautomata.

[BibT_eX]

Proceedings of the Jewels are Forever, 1999

1998

Cluster-cover a theoretical framework for a class of VLSI-CAD optimization problems.

[BibT_eX]

[DOI]

ACM Trans. Design Autom. Electr. Syst., 1998

Relative Liveness: From Intuition to Automated Verification.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 1998

An Approach to Modeling and Testing Memories and Its Application to CAMs.

[BibT_eX]

[DOI]

Piotr R. Sidorowicz

Proceedings of the 16th IEEE VLSI Test Symposium (VTS '98), 28 April, 1998

1997

A Characterization of Finite Ternary Algebras.

[BibT_eX]

[DOI]

J. J. Lou

Int. J. Algebra Comput., 1997

Testing for Bounded Faults in RAMs.

[BibT_eX]

[DOI]

René David

J. Electron. Test., 1997

1996

An algebra of multiple faults in RAMs.

[BibT_eX]

[DOI]

J. Electron. Test., 1996

1995

Testing C-elements is not elementary.

[BibT_eX]

[DOI]

Kaamran Raahemifar

Proceedings of the Second Working Conference on Asynchronous Design Methodologies, 1995

A framework for the analysis and design of algorithms for a class of VLSI-CAD optimization problems.

[BibT_eX]

[DOI]

Proceedings of the 1995 Conference on Asia Pacific Design Automation, Makuhari, Massa, Chiba, Japan, August 29, 1995

Asynchronous Circuits.

[BibT_eX]

[DOI]

Monographs in Computer Science, Springer, ISBN: 978-1-4612-4210-9, 1995

1994

Generalized Ternary Simulation of Sequential Circuits.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1994

1992

On the Delay-Sensitivity of Gate Networks.

[BibT_eX]

[DOI]

Jo C. Ebergen

IEEE Trans. Computers, 1992

Near-optimal tests for classes of write-triggered coupling faults in RAMs.

[BibT_eX]

[DOI]

Bruce F. Cockburn

J. Electron. Test., 1992

A model for sequential machine testing and diagnosis.

[BibT_eX]

[DOI]

J. Electron. Test., 1992

Efficient constrained encoding for VLSI sequential logic synthesis.

[BibT_eX]

[DOI]

Proceedings of the conference on European design automation, 1992

1991

Consistency and satisfiability of waveform timing specifications.

[BibT_eX]

[DOI]

T. Gahlinger

Farhad Mavaddat

Networks, 1991

1990

Switch-level testability of the dynamic CMOS PLA.

[BibT_eX]

[DOI]

Bruce F. Cockburn

Integr., 1990

Detection of coupling faults in RAMs.

[BibT_eX]

[DOI]

Bruce F. Cockburn

J. Electron. Test., 1990

1989

A unified framework for race analysis of asynchronous networks.

[BibT_eX]

[DOI]

J. ACM, 1989

Minimization by reversal is not new.

[BibT_eX]

Bull. EATCS, 1989

Recent Developments in the Design of Asynchronous Circuits.

[BibT_eX]

[DOI]

Jo C. Ebergen

Proceedings of the Fundamentals of Computation Theory, 1989

1988

An Optimistic Ternary Simulation of Gate Races.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1988

1987

A Characterization of Ternary Simulation of Gate Networks.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1987

Combinational static CMOS networks.

[BibT_eX]

[DOI]

Integr., 1987

1986

Graph Congruences and Pair Testing.

[BibT_eX]

[DOI]

Robert Knast

RAIRO Theor. Informatics Appl., 1986

Correspondence between Ternary Simulation and Binary Race Analysis in Gate Networks (Extended Summary).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

Combinatorial Static CMOD Networks (Extended Summary).

[BibT_eX]

[DOI]

Proceedings of the VLSI Algorithms and Architectures, 1986

1985

On serializability.

[BibT_eX]

[DOI]

S. Muro

Int. J. Parallel Program., 1985

1984

On generalized locally testable languages.

[BibT_eX]

[DOI]

Faith E. Fich

Discret. Math., 1984

1980

On Equations for Regular Languages, Finite Automata, and Sequential Networks.

[BibT_eX]

[DOI]

Ernst L. Leiss

Theor. Comput. Sci., 1980

Languages of R-Trivial Monoids.

[BibT_eX]

[DOI]

Faith E. Fich

J. Comput. Syst. Sci., 1980

Developments in the Theory of regular Languages.

[BibT_eX]

Proceedings of the Information Processing, Proceedings of the 8th IFIP Congress 1980, Tokyo, Japan - October 6-9, 1980 and Melbourne, Australia, 1980

1979

On a Ternary Model of Gate Networks.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1979

A Characterization of a Dot-Depth Two Analogue of Generalized Definite Languages.

[BibT_eX]

[DOI]

Faith E. Fich

Proceedings of the Automata, 1979

1978

The Dot-Depth Hierarchy of Star-Free Languages is Infinite.

[BibT_eX]

[DOI]

Robert Knast

J. Comput. Syst. Sci., 1978

1976

Hierarchies of Aperiodic Languages.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1976

Run languages.

[BibT_eX]

[DOI]

John A. Brzozowski

Discret. Math., 1976

1974

Models for Analysis of Races in Sequential Networks.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science, 1974

1973

Characterizations of locally testable events.

[BibT_eX]

[DOI]

Imre Simon

Discret. Math., 1973

1972

On Translation Algorithms in Residue Number Systems.

[BibT_eX]

[DOI]

Dilip K. Banerji

IEEE Trans. Computers, 1972

1971

About Feedback and SR Flip-Flops.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1971

Dot-Depth of Star-Free Events.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1971

Classification of Noncounting Events.

[BibT_eX]

[DOI]

Karel Culík II

Armen Gabrielian

J. Comput. Syst. Sci., 1971

1970

R70-44 Synchronization and General Repetitive Machines, with Applications to Ultimate Definite Automata.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1970

General Properties of Star Height of Regular Events.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1970

1969

Sign Detection in Residue Number Systems.

[BibT_eX]

[DOI]

Dilip K. Banerji

IEEE Trans. Computers, 1969

On Decompositions of Regular Events.

[BibT_eX]

[DOI]

J. ACM, 1969

1968

Definite Asynchronous Sequential Circuits.

[BibT_eX]

[DOI]

Shanker Singh

IEEE Trans. Computers, 1968

Regular-Like Expressions for Some Irregular Languages

[BibT_eX]

[DOI]

Proceedings of the 9th Annual Symposium on Switching and Automata Theory, 1968

1967

On Single-Loop Realizations of Sequential Machines

[BibT_eX]

[DOI]

Inf. Control., March, 1967

Roots of Star Events.

[BibT_eX]

[DOI]

J. ACM, 1967

On the Star Height of Regular Events

[BibT_eX]

[DOI]

Proceedings of the 8th Annual Symposium on Switching and Automata Theory, 1967

1966

On the Linearity of Sequential Machines.

[BibT_eX]

[DOI]

Wayne A. Davis

IEEE Trans. Electron. Comput., 1966

1965

Some Problems in Relay Circuit Design.

[BibT_eX]

[DOI]

IEEE Trans. Electron. Comput., 1965

Regular Expressions for Linear Sequential Circuits.

[BibT_eX]

[DOI]

IEEE Trans. Electron. Comput., 1965

On single-loop realizations of automata

[BibT_eX]

[DOI]

Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design, 1965

1964

About Signal Flow Graph Techniques for Sequential Circuits.

[BibT_eX]

[DOI]

Edward J. McCluskey

IEEE Trans. Electron. Comput., 1964

On the Linearity of Autonomous Sequential Machines.

[BibT_eX]

[DOI]

Wayne A. Davis

IEEE Trans. Electron. Comput., 1964

Regular Expressions from Sequential Circuits.

[BibT_eX]

[DOI]

IEEE Trans. Electron. Comput., 1964

Derivatives of Regular Expressions.

[BibT_eX]

[DOI]

J. ACM, 1964

1963

On the Construction of Sequential Machines from Regular Expressions.

[BibT_eX]

[DOI]

J. F. Poage

IEEE Trans. Electron. Comput., 1963

Signal Flow Graph Techniques for Sequential Circuit State Diagrams.

[BibT_eX]

[DOI]

Edward J. McCluskey

IEEE Trans. Electron. Comput., 1963

1962

A Survey of Regular Expressions and Their Applications.

[BibT_eX]

[DOI]