Automata theory for XML researchers
ACM SIGMOD Record
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Theoretical Computer Science - Descriptional complexity of formal systems
Taxonomy of XML schema languages using formal language theory
ACM Transactions on Internet Technology (TOIT)
Enumeration and random generation of accessible automata
Theoretical Computer Science
XPath, transitive closure logic, and nested tree walking automata
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Tree-Walking Automata Do Not Recognize All Regular Languages
SIAM Journal on Computing
Five Determinisation Algorithms
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Learning Minimal Separating DFA's for Compositional Verification
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
REGAL: a library to randomly and exhaustively generate automata
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Experimental evaluation of classical automata constructions
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Antichains: a new algorithm for checking universality of finite automata
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Generating, sampling and counting subclasses of regular tree languages
Proceedings of the 14th International Conference on Database Theory
Loops and overloops for tree walking automata
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Loops and overloops for Tree-Walking Automata
Theoretical Computer Science
| Hi-index | 0.00 |
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential letter-to-letter transducers up to isomorphism. We tailor this general scheme to randomly generate deterministic tree walking automata and deterministic top-down tree automata. We apply our implementation of the generator to the estimation of the average complexity of a deterministic tree walking automata to nondeterministic top-down tree automata construction we also implemented.