We stand with Ukraine

We stand with Ukraine

Ondrej Klíma

Affiliations:

Masaryk University, Department of Mathematics and Statistics, Brno, Czech Republic

According to our database¹, Ondrej Klíma authored at least 38 papers between 1999 and 2022.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2022

Geometrically closed positive varieties of languages.

[BibT_eX]

[DOI]

,

Peter Kostolányi

Inf. Comput., 2022

On linear languages recognized by deterministic biautomata.

[BibT_eX]

[DOI]

Galina Jirásková

,

Inf. Comput., 2022

2021

Binary patterns in the Prouhet-Thue-Morse sequence.

[BibT_eX]

[DOI]

,

Discret. Math. Theor. Comput. Sci., 2021

2020

Forbidden Patterns for Ordered Automata.

[BibT_eX]

[DOI]

,

J. Autom. Lang. Comb., 2020

Profinite congruences and unary algebras.

[BibT_eX]

[DOI]

,

CoRR, 2020

Geometrically Closed Positive Varieties of Star-Free Languages.

[BibT_eX]

[DOI]

,

Peter Kostolányi

Proceedings of the Language and Automata Theory and Applications, 2020

2019

Syntactic structures of regular languages.

[BibT_eX]

[DOI]

,

Theor. Comput. Sci., 2019

On the insertion of n-powers.

[BibT_eX]

[DOI]

,

Discret. Math. Theor. Comput. Sci., 2019

Deterministic Biautomata and Subclasses of Deterministic Linear Languages.

[BibT_eX]

[DOI]

Galina Jirásková

,

Proceedings of the Language and Automata Theory and Applications, 2019

On Varieties of Ordered Automata.

[BibT_eX]

[DOI]

,

Proceedings of the Language and Automata Theory and Applications, 2019

2016

Reducibility vs. definability for pseudovarieties of semigroups.

[BibT_eX]

[DOI]

,

Int. J. Algebra Comput., 2016

The omega-inequality problem for concatenation hierarchies of star-free languages.

[BibT_eX]

[DOI]

,

,

CoRR, 2016

2015

On fixed points of the lower set operator.

[BibT_eX]

[DOI]

,

,

,

Int. J. Algebra Comput., 2015

On Decidability of Intermediate Levels of Concatenation Hierarchies.

[BibT_eX]

[DOI]

,

Jana Bartonová

,

,

Proceedings of the Developments in Language Theory - 19th International Conference, 2015

2014

On Varieties of Automata Enriched with an Algebraic Structure (Extended Abstract).

[BibT_eX]

[DOI]

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

2013

Alternative Automata Characterization of Piecewise Testable Languages.

[BibT_eX]

[DOI]

,

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012

On biautomata.

[BibT_eX]

[DOI]

,

RAIRO Theor. Informatics Appl., 2012

Biautomata for k-Piecewise Testable Languages.

[BibT_eX]

[DOI]

,

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

Descriptional Complexity of Biautomata.

[BibT_eX]

[DOI]

Galina Jirásková

,

Proceedings of the Descriptional Complexity of Formal Systems, 2012

2011

Subhierarchies of the Second Level in the Straubing-THéRien Hierarchy.

[BibT_eX]

[DOI]

,

Int. J. Algebra Comput., 2011

Piecewise testable languages via combinatorics on words.

[BibT_eX]

[DOI]

Discret. Math., 2011

Rewriting in Varieties of Idempotent Semigroups.

[BibT_eX]

[DOI]

,

Miroslav Korbelár

,

Proceedings of the Algebraic Informatics - 4th International Conference, 2011

Identity Problems, Solvability of Equations and Unification in Varieties of Semigroups Related to Varieties of Groups.

[BibT_eX]

[DOI]

,

Proceedings of the Algebraic Foundations in Computer Science, 2011

2010

Literally Idempotent Languages and their Varieties - Two Letter Case.

[BibT_eX]

[DOI]

,

Int. J. Found. Comput. Sci., 2010

Hierarchies of Piecewise Testable Languages.

[BibT_eX]

[DOI]

,

Int. J. Found. Comput. Sci., 2010

New decidable upper bound of the second level in the Straubing-Thérien concatenation hierarchy of star-free languages.

[BibT_eX]

[DOI]

,

Discret. Math. Theor. Comput. Sci., 2010

Descriptional Complexity of the Languages KaL: Automata, Monoids and Varieties

[BibT_eX]

[DOI]

,

Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

On Schützenberger Products of Semirings.

[BibT_eX]

[DOI]

,

Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009

A counterexample to a conjecture concerning concatenation hierarchies.

[BibT_eX]

[DOI]

,

Inf. Process. Lett., 2009

Polynomial Operators on Classes of Regular Languages.

[BibT_eX]

[DOI]

,

Proceedings of the Algebraic Informatics, Third International Conference, 2009

2008

On varieties of meet automata.

[BibT_eX]

[DOI]

,

Theor. Comput. Sci., 2008

On Varieties of Literally Idempotent Languages.

[BibT_eX]

[DOI]

,

RAIRO Theor. Informatics Appl., 2008

Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent Groups.

[BibT_eX]

[DOI]

,

Proceedings of the Language and Automata Theory and Applications, 2008

2006

Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture.

[BibT_eX]

[DOI]

,

,

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

2004

Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups

[BibT_eX]

[DOI]

,

,

Electron. Colloquium Comput. Complex., 2004

2002

Unification Modulo Associativity and Idempotency Is NP-complete.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

2000

Matching Modulo Associativity and Idempotency Is NP-Complete.

[BibT_eX]

[DOI]

,

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

1999

Pattern Equations and Equations with Stuttering.

[BibT_eX]

[DOI]

,

,

Proceedings of the SOFSEM '99, Theory and Practice of Informatics, 26th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 27, 1999

Loading...