Regular Sets of Pomsets with Autoconcurrency
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
An Automaton Model of User-Controlled Navigation on the Web
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Message-passing automata are expressively equivalent to EMSO logic
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Finite automata on unranked and unordered DAGs
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
Fundamenta Informaticae
On the expressiveness of asynchronous cellular automata
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
On the bisimulation invariant fragment of monadic Σ1 in the finite
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Automata on directed graphs: edge versus vertex marking
ICGT'06 Proceedings of the Third international conference on Graph Transformations
| Hi-index | 0.00 |