Libor Polák

According to our database1, Libor Polák authored at least 24 papers between 2001 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Syntactic structures of regular languages.
Theor. Comput. Sci., 2019

On Varieties of Ordered Automata.
Proceedings of the Language and Automata Theory and Applications, 2019

2018
Forbidden patterns for ordered automata.
Proceedings of the Tenth Workshop on Non-Classical Models of Automata and Applications, 2018

2013
Alternative Automata Characterization of Piecewise Testable Languages.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012
Biautomata for k-Piecewise Testable Languages.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2011
Subhierarchies of the Second Level in the Straubing-THéRien Hierarchy.
Int. J. Algebra Comput., 2011

On Biautomata.
Proceedings of the Third Workshop on Non-Classical Models for Automata and Applications - NCMA 2011, Milan, Italy, July 18, 2011

Rewriting in Varieties of Idempotent Semigroups.
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.
Proceedings of the Algebraic Foundations in Computer Science, 2011

2010
Descriptional Complexity of the Languages KaL: Automata, Monoids and Varieties
Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

On Schützenberger Products of Semirings.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009
Polynomial Operators on Classes of Regular Languages.
Proceedings of the Algebraic Informatics, Third International Conference, 2009

2008
On varieties of meet automata.
Theor. Comput. Sci., 2008

On Varieties of Literally Idempotent Languages.
RAIRO Theor. Informatics Appl., 2008

Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent Groups.
Proceedings of the Language and Automata Theory and Applications, 2008

Hierarchies of Piecewise Testable Languages.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

Literally idempotent languages and their varieties - two letter case.
Proceedings of the Automata and Formal Languages, 12th International Conference, 2008

2006
Small Conjunctive Varieties of Regular Languages.
Acta Cybern., 2006

2005
Remarks on Multiple Entry Deterministic Finite Automata.
Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005

2004
On Pseudovarieties of Semiring Homomorphisms.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Minimalizations of NFA Using the Universal Automaton.
Proceedings of the 6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26, 2004

2003
Syntactic Semiring and Universal Automaton.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2002
Syntactic Semiring and Language Equations.
Proceedings of the Implementation and Application of Automata, 2002

2001
Syntactic Semiring of a Language.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001


  Loading...