The SCEAS System
Navigation Menu

Conferences in DBLP

Conference on Implementation and Application of Automata (CIAA) (wia)
2008 (conf/wia/2008)


  1. Nondeterministic Finite Automata-Recent Results on the Descriptional and Computational Complexity. [Citation Graph (, )][DBLP]


  2. Language Decompositions, Primality, and Trajectory-Based Operations. [Citation Graph (, )][DBLP]


  3. Automata, Probability, and Recursion. [Citation Graph (, )][DBLP]


  4. Concurrency, Synchronization, and Conflicts in Petri Nets. [Citation Graph (, )][DBLP]


  5. Automated Compositional Reasoning of Intuitionistically Closed Regular Properties. [Citation Graph (, )][DBLP]


  6. Antimirov and Mosses's Rewrite System Revisited. [Citation Graph (, )][DBLP]


  7. Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata. [Citation Graph (, )][DBLP]


  8. Testing Whether a Binary and Prolongeable Regular Language LIs Geometrical or Not on the Minimal Deterministic Automaton of Pref(L). [Citation Graph (, )][DBLP]


  9. Hopcroft's Minimization Technique: Queues or Stacks?. [Citation Graph (, )][DBLP]


  10. Learning Regular Languages Using Nondeterministic Finite Automata. [Citation Graph (, )][DBLP]


  11. Multi-Return Macro Tree Transducers. [Citation Graph (, )][DBLP]


  12. Computing Convex Hulls by Automata Iteration. [Citation Graph (, )][DBLP]


  13. A Translation from the HTML DTD into a Regular Hedge Grammar. [Citation Graph (, )][DBLP]


  14. Tree-Series-to-Tree-Series Transformations. [Citation Graph (, )][DBLP]


  15. Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning. [Citation Graph (, )][DBLP]


  16. Pattern Matching in DCA Coded Text. [Citation Graph (, )][DBLP]


  17. Five Determinisation Algorithms. [Citation Graph (, )][DBLP]


  18. Persistent Computations of Turing Machines. [Citation Graph (, )][DBLP]


  19. On Complexity of Two Dimensional Languages Generated by Transducers. [Citation Graph (, )][DBLP]


  20. Games for Temporal Logics on Trees. [Citation Graph (, )][DBLP]


  21. A Run-Time Efficient Implementation of Compressed Pattern Matching Automata. [Citation Graph (, )][DBLP]


  22. Composed Bisimulation for Tree Automata. [Citation Graph (, )][DBLP]


  23. Hyper-Minimization in O(n2). [Citation Graph (, )][DBLP]


  24. Deterministic Pushdown Automata and Unary Languages. [Citation Graph (, )][DBLP]


  25. Finite Eilenberg Machines. [Citation Graph (, )][DBLP]


  26. The Number of Runs in Sturmian Words. [Citation Graph (, )][DBLP]


  27. 3-Way Composition of Weighted Finite-State Transducers. [Citation Graph (, )][DBLP]


  28. Progressive Solutions to FSM Equations. [Citation Graph (, )][DBLP]


  29. Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees. [Citation Graph (, )][DBLP]


  30. Approximate Periods with Levenshtein Distance. [Citation Graph (, )][DBLP]

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002