#### Filter Results:

- Full text PDF available (74)

#### Publication Year

1976

2017

- This year (7)
- Last 5 years (46)
- Last 10 years (91)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Stephen L. Bloom, Zoltán Ésik
- EATCS Monographs on Theoretical Computer Science
- 1993

- Stephen L. Bloom, Zoltán Ésik
- MFPS
- 1993

- Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir
- AMAST
- 2002

This paper gives an equational axiomatization of probabilistic bisimulation equivalence for a class of finite-state agents previously studied by Stark and Smolka ((2000) Proof, Language, and Interaction: Essays in Honour of Robin Milner, pp. 571–595). The axiomatization is obtained by extending the general axioms of iteration theories (or iteration… (More)

- Zoltán Ésik, Masami Ito
- Acta Cybern.
- 2003

We define the degree of aperiodicity of finite automata and show that for every set M of positive integers, the class QAM of finite automata whose degree of aperiodicity belongs to the division ideal generated by M is closed with respect to direct products, disjoint unions, subautomata, homomorphic images and renamings. These closure conditions define… (More)

- Stephen L. Bloom, Zoltán Ésik
- Mathematical Structures in Computer Science
- 1993

- Zoltán Ésik, Werner Kuich
- Journal of Automata, Languages and Combinatorics
- 2003

In this survey we generalize some results on formal tree languages, tree grammars and tree automata by an algebraic treatment using semirings, fixed point theory, formal tree series and matrices. The use of these mathematical constructs makes definitions, constructions, and proofs more satisfactory from an mathematical point of view than the customary ones.… (More)

- Zoltán Ésik
- Inf. Comput.
- 1999

- Stephen L. Bloom, Zoltán Ésik
- Inf. Comput.
- 2005

- Zoltán Ésik, Zoltán L. Németh
- Journal of Automata, Languages and Combinatorics
- 2004

We provide the basics of a 2-dimensional theory of automata on series-parallel biposets. We define recognizable, regular and rational sets of series-parallel biposets and study their relationship. Moreover, we relate these classes to languages of series-parallel biposets definable in monadic second-order logic.

- Stephen L. Bloom, Zoltán Ésik
- MFCS
- 1994