On the complexity of Simon automata over the Dyck language
Journal of Automata, Languages and Combinatorics
Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
Theoretical Computer Science - Developments in language theory
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
On the Decidability of Bounded Valuedness for Transducers
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
General Algorithms for Testing the Ambiguity of Finite Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Component Simulation-based Substitutivity Managing QoS Aspects
Electronic Notes in Theoretical Computer Science (ENTCS)
Deciding the sequentiality of a finitely ambiguous max-plus automaton
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Component simulation-based substitutivity managing QoS and composition issues
Science of Computer Programming
Descriptional complexity of (un)ambiguous finite state machines and pushdown automata
RP'10 Proceedings of the 4th international conference on Reachability problems
Joint spectral radius theory for automated complexity analysis of rewrite systems
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Structurally unambiguous finite automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
On the maximum coefficients of rational formal series in commuting variables
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Visibly pushdown automata with multiplicities: finiteness and k-boundedness
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
| Hi-index | 5.23 |