Rationality in algebras with a series operation
Information and Computation
Axiomatizing the subsumption and subword preorders on finite and infinite partial words
Theoretical Computer Science
Infinite Series-Parallel Posets: Logic and Languages
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
A Model Theoretic Proof of Büchi-Type Theorems and First-Order Logic for N-Free Pomsets
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Pomsets for Local Trace Languages - Recognizability, Logic & Petri Nets
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Regular Sets of Pomsets with Autoconcurrency
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Automata on Series-Parallel Biposets
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Pomsets for local trace languages
Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
Towards a language theory for infinite N-free pomsets
Theoretical Computer Science
Regular binoid expressions and regular binoid languages
Theoretical Computer Science
Theoretical Computer Science
Journal of Automata, Languages and Combinatorics
On the logical definability of centrain graph and poset languages
Journal of Automata, Languages and Combinatorics
A hierarchy theorem for regular languages over free bisemigroups
Acta Cybernetica
Branching automata with costs: a way of reflecting parallelism in costs
Theoretical Computer Science - Implementation and application of automata
The recognizability of sets of graphs is a robust property
Theoretical Computer Science
Axiomatizing the identities of binoid languages
Theoretical Computer Science
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
Pomset Languages of Finite Step Transition Systems
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
Synthesis of Petri Nets from Term Based Representations of Infinite Partial Languages
Fundamenta Informaticae - Application of Concurrency to System Design
Branching automata with costs: a way of reflecting parallelism in costs
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Series-parallel languages on scattered and countable posets
Theoretical Computer Science
Kleene theorems for product systems
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Automata on directed graphs: edge versus vertex marking
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Canonizable partial order generators
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Synthesis of Petri Nets from Term Based Representations of Infinite Partial Languages
Fundamenta Informaticae - Application of Concurrency to System Design
Series-parallel languages on scattered and countable posets
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 5.24 |