Libor Polák - RankMe

33 papers B 2C 9Journal 13Unranked 9

Year	Rank	Type	Title / Venue / Authors
2020	J	`jnl`	Forbidden Patterns for Ordered Automata. J. Autom. Lang. Comb. Ondrej Klíma, Libor Polák
2019	C	`conf`	On Varieties of Ordered Automata. LATA Ondrej Klíma, Libor Polák
2019	J	`jnl`	Syntactic structures of regular languages. Theor. Comput. Sci. Ondrej Klíma, Libor Polák
2018	—	`conf`	Forbidden patterns for ordered automata. NCMA Ondrej Klíma, Libor Polák
2017	J	`jnl`	On Varieties of Ordered Automata. CoRR Ondrej Klíma, Libor Polák
2016	J	`jnl`	Syntactic Structures of Regular Languages. CoRR Ondrej Klíma, Libor Polák
2013	C	`conf`	Alternative Automata Characterization of Piecewise Testable Languages. Developments in Language Theory Ondrej Klíma, Libor Polák
2012	C	`conf`	Biautomata for k-Piecewise Testable Languages. Developments in Language Theory Ondrej Klíma, Libor Polák
2012	J	`jnl`	On biautomata. RAIRO Theor. Informatics Appl. Ondrej Klíma, Libor Polák
2011	—	`conf`	Identity Problems, Solvability of Equations and Unification in Varieties of Semigroups Related to Varieties of Groups. Algebraic Foundations in Computer Science Ondrej Klíma, Libor Polák
2011	—	`conf`	On Biautomata. NCMA Ondrej Klíma, Libor Polák
2011	—	`conf`	Rewriting in Varieties of Idempotent Semigroups. CAI Ondrej Klíma, Miroslav Korbelár, Libor Polák
2011	J	`jnl`	Subhierarchies of the Second Level in the Straubing-THéRien Hierarchy. Int. J. Algebra Comput. Ondrej Klíma, Libor Polák
2010	—	`conf`	Descriptional Complexity of the Languages KaL: Automata, Monoids and Varieties DCFS Ondrej Klíma, Libor Polák
2010	J	`jnl`	Hierarchies of Piecewise Testable Languages. Int. J. Found. Comput. Sci. Ondrej Klíma, Libor Polák
2010	J	`jnl`	Literally Idempotent Languages and their Varieties - Two Letter Case. Int. J. Found. Comput. Sci. Ondrej Klíma, Libor Polák
2010	C	`conf`	On Schützenberger Products of Semirings. Developments in Language Theory Ondrej Klíma, Libor Polák
2009	—	`conf`	Polynomial Operators on Classes of Regular Languages. CAI Ondrej Klíma, Libor Polák
2008	C	`conf`	Hierarchies of Piecewise Testable Languages. Developments in Language Theory Ondrej Klíma, Libor Polák
2008	C	`conf`	Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent Groups. LATA Ondrej Klíma, Libor Polák
2008	—	`conf`	Literally idempotent languages and their varieties - two letter case. AFL Ondrej Klíma, Libor Polák
2008	J	`jnl`	On Varieties of Literally Idempotent Languages. RAIRO Theor. Informatics Appl. Ondrej Klíma, Libor Polák
2008	J	`jnl`	On varieties of meet automata. Theor. Comput. Sci. Ondrej Klíma, Libor Polák
2007	J	`jnl`	Remarks on Multiple Entry Deterministic Finite Automata. J. Autom. Lang. Comb. Libor Polák
2006	J	`jnl`	Small Conjunctive Varieties of Regular Languages. Acta Cybern. Libor Polák
2005	J	`jnl`	Minimalizations of NFA using the universal automaton. Int. J. Found. Comput. Sci. Libor Polák
2005	—	`conf`	Remarks on Multiple Entry Deterministic Finite Automata. DCFS Libor Polák
2004	—	`conf`	Minimalizations of NFA Using the Universal Automaton. DCFS Libor Polák
2004	C	`conf`	Minimalizations of NFA Using the Universal Automaton. CIAA Libor Polák
2004	B	`conf`	On Pseudovarieties of Semiring Homomorphisms. MFCS Libor Polák
2003	C	`conf`	Syntactic Semiring and Universal Automaton. Developments in Language Theory Libor Polák
2002	C	`conf`	Syntactic Semiring and Language Equations. CIAA Libor Polák
2001	B	`conf`	Syntactic Semiring of a Language. MFCS Libor Polák