Theory of 2-structures. Part II: representation through labeled tree families
Theoretical Computer Science
Theoretical Computer Science
T-structures, T-functions, and texts
Theoretical Computer Science
Finite automata, formal logic, and circuit complexity
Finite automata, formal logic, and circuit complexity
Text languages in an algebraic framework
Fundamenta Informaticae - Special issue on formal language theory
Handbook of formal languages, vol. 3
Formal languages over free binoids
Journal of Automata, Languages and Combinatorics
Series-parallel languages and the bounded-width property
Theoretical Computer Science
Rationality in algebras with a series operation
Information and Computation
A Kleene Iteration for Parallelism
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Towards a language theory for infinite N-free pomsets
Theoretical Computer Science
Theoretical Computer Science
Journal of Automata, Languages and Combinatorics
A hierarchy theorem for regular languages over free bisemigroups
Acta Cybernetica
A note on identities of two-dimensional languages
Discrete Applied Mathematics
| Hi-index | 0.00 |
Bisemigroups are algebras equipped with two independent associative operations. Labeled finite sp-biposets may serve as a possible representation of the elements of the free bisemigroups. For finite sp-biposets, an accepting device, called parenthesizing automaton, was introduced in [6], and it was proved that its expressive power is equivalent to both algebraic recognizability and monadic second order definability. In this paper, we show, how this concept of parenthesizing automaton can be generalized for infinite biposets in a way that the equivalence of regularity (defined by acceptance with automata), recognizability (defined by homomorphisms and finite ω-bisemigroups) and MSO-definability remains true.