The following pages link to Zoltán Ésik (Q265801):
Displaying 50 items.
- (Q173927) (redirect page) (← links)
- A connection between concurrency and language theory (Q265802) (← links)
- An analysis of the equational properties of the well-founded fixed point (Q347388) (← links)
- Free inductive \(K\)-semialgebras (Q383784) (← links)
- Free iterative and iteration \(K\)-semialgebras (Q412016) (← links)
- Büchi context-free languages (Q627181) (← links)
- Free shuffle algebras in language varieties (Q671351) (← links)
- Fixed-point operations on ccc's. I (Q672122) (← links)
- Equational properties of Kleene algebras of relations with conversion (Q674338) (← links)
- A note on equations for commutative regular languages (Q697100) (← links)
- On Müller context-free grammars (Q764314) (← links)
- Algebras of iteration theories (Q789159) (← links)
- Axiomatizing the equational theory of regular tree languages (Q844887) (← links)
- Critical classes for the \(\alpha _ 0\)-product (Q908704) (← links)
- A Mezei-Wright theorem for categorical algebras (Q1044831) (← links)
- Complete classes of automata for the \(\alpha _ 0\)-product (Q1089802) (← links)
- On \(\alpha _ 0\)-products and \(\alpha _ 2\)-products (Q1091822) (← links)
- On a representation of tree automata (Q1098636) (← links)
- Independence of the equational axioms for iteration theories (Q1106011) (← links)
- On cycles of directed graphs (Q1106238) (← links)
- A decidability result for homomorphic representation of automata by \(\alpha _ 0\)-products (Q1123627) (← links)
- Equational properties of iteration in algebraically complete categories (Q1128480) (← links)
- Nonfinite axiomatizability of the equational theory of shuffle (Q1130164) (← links)
- A note on isomorphic simulation of automata by networks of two-state automata (Q1173982) (← links)
- Results on homomorphic realization of automata by \(\alpha_ 0\)-products (Q1177141) (← links)
- Varieties of automata and transformation semigroups (Q1207386) (← links)
- Iteration theories of synchronization trees (Q1207946) (← links)
- Group axioms for iteration (Q1283821) (← links)
- Notes on equational theories of relations (Q1344844) (← links)
- Axiomatizing shuffle and concatenation in languages (Q1383153) (← links)
- Modeling literal morphisms by shuffle (Q1383303) (← links)
- The equational logic of fixed points (Q1391734) (← links)
- Completeness of Park induction (Q1391869) (← links)
- A proof of the Krohn--Rhodes Decomposition Theorem (Q1575683) (← links)
- Axiomatizing the subsumption and subword preorders on finite and infinite partial words (Q1605337) (← links)
- Two equational theories of partial words (Q1643141) (← links)
- Algebraically complete semirings and Greibach normal form (Q1772777) (← links)
- The equational theory of regular words (Q1776401) (← links)
- (Q1819573) (redirect page) (← links)
- Axiomatizing schemes and their behaviors (Q1819574) (← links)
- Equational logic of circular data type specification (Q1825026) (← links)
- Locally closed semirings (Q1849558) (← links)
- On equations for union-free regular languages (Q1854402) (← links)
- The max-plus algebra of the natural numbers has no finite equational basis (Q1870591) (← links)
- Equational theories of tropical semirings (Q1874279) (← links)
- Hazard algebras (Q1878906) (← links)
- Inductive \(^{*}\)-semirings (Q1882911) (← links)
- An undecidable property of context-free linear orders (Q1944046) (← links)
- The variety of Kleene algebras with conversion is not finitely based (Q1978513) (← links)
- Equational theories for automata (Q2074221) (← links)
