Automata on Series-Parallel Biposets

Authors:
Zoltán Ésik;Z. L. Németh
Affiliations:
-;-
Venue:
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Year:
2001

Citing 18
Cited 4

Concurrency and atomicity

Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Theory of 2-structures. Part II: representation through labeled tree families

Theoretical Computer Science
The monadic second-order logic of graphs V: on closing the gap between definability and recognizability

MFCS '89 Selected papers of the symposium on Mathematical foundations of computer science
Angular 2–structures

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
Characterization and complexity of uniformly nonprimitive labeled 2-structures

Theoretical Computer Science
Text languages in an algebraic framework

Fundamenta Informaticae - Special issue on formal language theory
Two-dimensional finite state recognizability

Fundamenta Informaticae - Special issue on formal language theory
General varieties of tree languages

Theoretical Computer Science
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
Varieties Of Formal Languages

Varieties Of Formal Languages
Infinite Series-Parallel Posets: Logic and Languages

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Star-Free Picture Expressions are Strictly Weaker Than First-Order Logic

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
A Kleene Iteration for Parallelism

Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Monadic Second-Order Logic Over Pictures and Recognizability by Tiling Systems

STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science

Towards a language theory for infinite N-free pomsets

Theoretical Computer Science
A hierarchy theorem for regular languages over free bisemigroups

Acta Cybernetica
Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings

LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Series-parallel languages on scattered and countable posets

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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