| Publication | Date of Publication | Type |
|---|
| Maximally atomic languages | 2021-06-22 | Paper |
Maximally atomic languages
(available as arXiv preprint) | 2021-06-22 | Paper |
State complexity of overlap assembly
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
| On the complexity of the evaluation of transient extensions of Boolean functions | 2021-02-24 | Paper |
On the complexity of the evaluation of transient extensions of Boolean functions
(available as arXiv preprint) | 2021-02-24 | Paper |
| Quotient complexity of regular languages | 2021-01-26 | Paper |
Most complex deterministic union-free regular languages
(available as arXiv preprint) | 2020-06-30 | Paper |
| State complexity of single-word pattern matching in regular languages | 2020-05-12 | Paper |
Most complex non-returning regular languages
International Journal of Foundations of Computer Science | 2019-12-10 | Paper |
Complexity of proper prefix-convex regular languages
Theoretical Computer Science | 2019-08-20 | Paper |
State complexity of pattern matching in regular languages
Theoretical Computer Science | 2019-06-18 | Paper |
State complexity of overlap assembly
(available as arXiv preprint) | 2018-11-07 | Paper |
Towards a theory of complexity of regular languages
(available as arXiv preprint) | 2018-09-17 | Paper |
On the delay-sensitivity of gate networks
IEEE Transactions on Computers | 2018-09-14 | Paper |
Syntactic complexity of regular ideals
Theory of Computing Systems | 2018-07-23 | Paper |
scientific article; zbMATH DE number 6855103 (Why is no real title available?)
(available as arXiv preprint) | 2018-03-29 | Paper |
Syntactic complexity of suffix-free languages
Information and Computation | 2018-03-21 | Paper |
Quotient complexity of closed languages
Theory of Computing Systems | 2017-11-07 | Paper |
Complexity of suffix-free regular languages
Journal of Computer and System Sciences | 2017-09-07 | Paper |
Complexity of suffix-free regular languages
Journal of Computer and System Sciences | 2017-09-07 | Paper |
Most complex non-returning regular languages
(available as arXiv preprint) | 2017-08-31 | Paper |
Complexity of right-ideal, prefix-closed, and prefix-free regular languages
Acta Cybernetica | 2017-08-25 | Paper |
Complexity of proper prefix-convex regular languages
Implementation and Application of Automata | 2017-08-22 | Paper |
Complexity of left-ideal, suffix-closed and suffix-free regular languages
Language and Automata Theory and Applications | 2017-06-01 | Paper |
Most complex regular ideal languages
(available as arXiv preprint) | 2017-03-03 | Paper |
| Most complex regular ideal languages | 2017-03-03 | Paper |
Unrestricted state complexity of binary operations on regular languages
Descriptional Complexity of Formal Systems | 2016-11-09 | Paper |
On the State Complexity of the Shuffle of Regular Languages
Descriptional Complexity of Formal Systems | 2016-11-09 | Paper |
Quotient complexity of regular languages
Journal of Automata, Languages and Combinatorics | 2016-09-29 | Paper |
Quotient complexity of star-free languages
(available as arXiv preprint) | 2016-07-26 | Paper |
Quotient complexities of atoms in regular ideal languages
Acta Cybernetica | 2016-05-03 | Paper |
Large aperiodic semigroups
International Journal of Foundations of Computer Science | 2016-02-17 | Paper |
Complexity of suffix-free regular languages
Fundamentals of Computation Theory | 2015-09-29 | Paper |
Upper bound on syntactic complexity of suffix-free languages
Descriptional Complexity of Formal Systems | 2015-08-07 | Paper |
| Syntactic complexities of six classes of star-free languages | 2015-03-16 | Paper |
Syntactic complexity of \(\mathcal{R}\)- and \(\mathcal{J}\)-trivial regular languages
International Journal of Foundations of Computer Science | 2015-02-09 | Paper |
Upper bounds on syntactic complexity of left and two-sided ideals
Developments in Language Theory | 2014-10-14 | Paper |
Large Aperiodic Semigroups
Implementation and Application of Automata | 2014-09-26 | Paper |
Most Complex Regular Right-Ideal Languages
Descriptional Complexity of Formal Systems | 2014-08-07 | Paper |
Complexity of atoms of regular languages
International Journal of Foundations of Computer Science | 2014-08-04 | Paper |
Symmetric groups and quotient complexity of Boolean operations
Automata, Languages, and Programming | 2014-07-01 | Paper |
Theory of átomata
Theoretical Computer Science | 2014-06-06 | Paper |
In search of most complex regular languages
International Journal of Foundations of Computer Science | 2014-03-10 | Paper |
Syntactic complexity of \({\mathcal R}\)- and \({\mathcal J}\)-trivial regular languages
Descriptional Complexity of Formal Systems | 2013-08-09 | Paper |
Universal witnesses for state complexity of Boolean operations and concatenation combined with star
Descriptional Complexity of Formal Systems | 2013-08-09 | Paper |
Universal witnesses for state complexity of basic operations combined with reversal
Implementation and Application of Automata | 2013-08-07 | Paper |
QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES
International Journal of Foundations of Computer Science | 2013-06-06 | Paper |
Quotient complexity of ideal languages
Theoretical Computer Science | 2013-02-19 | Paper |
Quotient complexities of atoms of regular languages
Developments in Language Theory | 2012-11-02 | Paper |
Syntactic complexities of some classes of star-free languages
Descriptional Complexity of Formal Systems | 2012-11-02 | Paper |
Syntactic complexities of some classes of star-free languages
Descriptional Complexity of Formal Systems | 2012-11-02 | Paper |
In Search of Most Complex Regular Languages
Implementation and Application of Automata | 2012-09-20 | Paper |
On the complexity of the evaluation of transient extensions of Boolean functions
International Journal of Foundations of Computer Science | 2012-08-30 | Paper |
Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
Theoretical Computer Science | 2012-08-13 | Paper |
| Gate circuits with feedback in finite multivalued algebras of transients | 2012-04-26 | Paper |
Theory of átomata
Developments in Language Theory | 2011-07-29 | Paper |
Syntactic complexity of ideal and closed languages
Developments in Language Theory | 2011-07-29 | Paper |
Syntactic complexity of prefix-, suffix-, and bifix-free regular languages
Descriptional Complexity of Formal Systems | 2011-07-29 | Paper |
Decision problems for convex languages
Information and Computation | 2011-07-27 | Paper |
Closures in formal languages and Kuratowski's theorem
International Journal of Foundations of Computer Science | 2011-03-30 | Paper |
Representation of semiautomata by canonical words and equivalences. II: Specification of software modules
International Journal of Foundations of Computer Science | 2011-01-06 | Paper |
Quotient complexity of closed languages
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Complexity in convex languages
Language and Automata Theory and Applications | 2010-05-26 | Paper |
Quotient Complexity of Ideal Languages
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
| Languages convex with respect to binary relations, and their closure properties | 2010-04-08 | Paper |
State-complexity hierarchies of uniform languages of alphabet-size length
Theoretical Computer Science | 2009-08-07 | Paper |
Predictable semiautomata
Theoretical Computer Science | 2009-08-07 | Paper |
Closures in Formal Languages and Kuratowski’s Theorem
Developments in Language Theory | 2009-07-07 | Paper |
Decision Problems for Convex Languages
Language and Automata Theory and Applications | 2009-04-02 | Paper |
COVERING OF TRANSIENT SIMULATION OF FEEDBACK-FREE CIRCUITS BY BINARY ANALYSIS
International Journal of Foundations of Computer Science | 2006-08-21 | Paper |
Representation of a class of nondeterministic semiautomata by canonical words.
Theoretical Computer Science | 2006-05-18 | Paper |
REPRESENTATION OF SEMIAUTOMATA BY CANONICAL WORDS AND EQUIVALENCES
International Journal of Foundations of Computer Science | 2005-11-14 | Paper |
SIMULATION OF FEEDBACK-FREE CIRCUITS IN THE ALGEBRA OF TRANSIENTS
International Journal of Foundations of Computer Science | 2005-10-19 | Paper |
INVOLUTED SEMILATTICES AND UNCERTAINTY IN TERNARY ALGEBRAS
International Journal of Algebra and Computation | 2005-09-27 | Paper |
Gate circuits in the algebra of transients
RAIRO - Theoretical Informatics and Applications | 2005-06-07 | Paper |
Gate circuits in the algebra of transients
RAIRO - Theoretical Informatics and Applications | 2005-06-07 | Paper |
Gate circuits in the algebra of transients
RAIRO - Theoretical Informatics and Applications | 2005-06-07 | Paper |
Theory Is Forever
Lecture Notes in Computer Science | 2005-01-18 | Paper |
Hazard algebras
Formal Methods in System Design | 2004-09-09 | Paper |
| scientific article; zbMATH DE number 2042609 (Why is no real title available?) | 2004-02-15 | Paper |
| scientific article; zbMATH DE number 1962767 (Why is no real title available?) | 2003-08-11 | Paper |
| scientific article; zbMATH DE number 1962772 (Why is no real title available?) | 2003-08-11 | Paper |
True concurrency in models of asynchronous circuit behavior
Formal Methods in System Design | 2003-05-11 | Paper |
A CHARACTERIZATION OF de MORGAN ALGEBRAS
International Journal of Algebra and Computation | 2002-12-15 | Paper |
| Hazard algebras. (Extended abstract) | 2002-02-28 | Paper |
Some applications of ternary algebras
Publicationes Mathematicae Debrecen | 2002-02-13 | Paper |
| scientific article; zbMATH DE number 1408329 (Why is no real title available?) | 2000-09-26 | Paper |
Automata of asynchronous behaviors
Theoretical Computer Science | 2000-08-23 | Paper |
Delay-insensitivity and ternary simulation
Theoretical Computer Science | 2000-08-21 | Paper |
Generalized ternary simulation of sequential circuits
RAIRO - Theoretical Informatics and Applications | 1997-10-30 | Paper |
| scientific article; zbMATH DE number 1047922 (Why is no real title available?) | 1997-08-12 | Paper |
| scientific article; zbMATH DE number 897892 (Why is no real title available?) | 1996-07-08 | Paper |
| scientific article; zbMATH DE number 8771 (Why is no real title available?) | 1992-06-25 | Paper |
| scientific article; zbMATH DE number 8785 (Why is no real title available?) | 1992-06-25 | Paper |
Consistency and satisfiability of waveform timing specifications
Networks | 1991-01-01 | Paper |
A unified framework for race analysis of asynchronous networks
Journal of the ACM | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4204281 (Why is no real title available?) | 1989-01-01 | Paper |
An optimistic ternary simulation of gate races
Theoretical Computer Science | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4043765 (Why is no real title available?) | 1987-01-01 | Paper |
A Characterization of Ternary Simulation of Gate Networks
IEEE Transactions on Computers | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3959288 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3956984 (Why is no real title available?) | 1986-01-01 | Paper |
Graph congruences and pair testing
RAIRO - Theoretical Informatics and Applications | 1986-01-01 | Paper |
On serializability
International Journal of Computer & Information Sciences | 1985-01-01 | Paper |
On generalized locally testable languages
Discrete Mathematics | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3692677 (Why is no real title available?) | 1980-01-01 | Paper |
On equations for regular languages, finite automata, and sequential networks
Theoretical Computer Science | 1980-01-01 | Paper |
Languages of R-trivial monoids
Journal of Computer and System Sciences | 1980-01-01 | Paper |
On a Ternary Model of Gate Networks
IEEE Transactions on Computers | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3640907 (Why is no real title available?) | 1979-01-01 | Paper |
The dot-depth hierarchy of star-free languages is infinite
Journal of Computer and System Sciences | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3568549 (Why is no real title available?) | 1977-01-01 | Paper |
A generalization of finiteness
Semigroup Forum | 1977-01-01 | Paper |
Run languages
Discrete Mathematics | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3483927 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3519903 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3519903 (Why is no real title available?) | 1975-01-01 | Paper |
Characterizations of locally testable events
Discrete Mathematics | 1973-01-01 | Paper |
On Translation Algorithms in Residue Number Systems
IEEE Transactions on Computers | 1972-01-01 | Paper |
About Feedback and SR Flip-Flops
IEEE Transactions on Computers | 1971-01-01 | Paper |
Dot-depth of star-free events
Journal of Computer and System Sciences | 1971-01-01 | Paper |
Classification of noncounting events
Journal of Computer and System Sciences | 1971-01-01 | Paper |
General properties of star height of regular events
Journal of Computer and System Sciences | 1970-01-01 | Paper |
On Decompositions of Regular Events
Journal of the ACM | 1969-01-01 | Paper |
Sign Detection in Residue Number Systems
IEEE Transactions on Computers | 1969-01-01 | Paper |
Definite Asynchronous Sequential Circuits
IEEE Transactions on Computers | 1968-01-01 | Paper |
On single-loop realizations of sequential machines
Information and Control | 1967-01-01 | Paper |
Roots of Star Events
Journal of the ACM | 1967-01-01 | Paper |
A Diagrammatic Approach to Multilevel Logic Synthesis
IEEE Transactions on Electronic Computers | 1965-01-01 | Paper |
Derivatives of Regular Expressions
Journal of the ACM | 1964-01-01 | Paper |
| scientific article; zbMATH DE number 3189697 (Why is no real title available?) | 1963-01-01 | Paper |
Boolean Matrices and the Stability of Neural Nets
IEEE Transactions on Electronic Computers | 1963-01-01 | Paper |
A Survey of Regular Expressions and Their Applications
IRE Transactions on Electronic Computers | 1962-01-01 | Paper |
