Higher dimensional automata

Authors:
Zoltán Ésik;Zoltán L. Németh
Affiliations:
Department of Computer Science, University of Szeged, P.O. Box 652, H-6701 Szeged, Hungary;Department of Computer Science, University of Szeged, P.O. Box 652, H-6701 Szeged, Hungary
Venue:
Journal of Automata, Languages and Combinatorics
Year:
2004

Citing 19
Cited 10

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
Automata, Languages, and Machines

Automata, Languages, and Machines
Varieties Of Formal Languages

Varieties Of Formal Languages
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
A note on identities of two-dimensional languages

Discrete Applied Mathematics
The recognizability of sets of graphs is a robust property

Theoretical Computer Science
Axiomatizing the identities of binoid languages

Theoretical Computer Science
Automata on infinite biposets

Acta Cybernetica
Weighted Logics for Nested Words and Algebraic Formal Power Series

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Note: Existential MSO over two successors is strictly weaker than over linear orders

Theoretical Computer Science
Definable transductions and weighted logics for texts

Theoretical Computer Science
A note on identities of two-dimensional languages

Discrete Applied Mathematics
Definable transductions and weighted logics for texts

DLT'07 Proceedings of the 11th international conference on Developments in language theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.