Automatic Graphs and Graph D0L-Systems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
A Chomsky-Like Hierarchy of Infinite Graphs
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Axiomatising Tree-Interpretable Structures
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Some Applications of the Decidability of DPDA's Equivalence
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Decidable Theories of Cayley-Graphs
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Automatic structures: overview and future directions
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Definable relations and first-order query languages over strings
Journal of the ACM (JACM)
Automatic graphs and D0L-sequences of finite graphs
Journal of Computer and System Sciences
The synthesis of petri nets from path-automatic specifications
Information and Computation
Automatic linear orders and trees
ACM Transactions on Computational Logic (TOCL)
A structural approach to reversible computation
Theoretical Computer Science
Logical definability and query languages over ranked and unranked trees
ACM Transactions on Computational Logic (TOCL)
Bounds on the automata size for Presburger arithmetic
ACM Transactions on Computational Logic (TOCL)
Finite Automata Presentable Abelian Groups
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Automatic Presentations for Cancellative Semigroups
Language and Automata Theory and Applications
When Is Reachability Intrinsically Decidable?
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Don't care words with an application to the automata-based approach for real addition
Formal Methods in System Design
Automata and Answer Set Programming
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Unary automatic graphs: An algorithmic perspective
Mathematical Structures in Computer Science
Analysing Complexity in Classes of Unary Automatic Structures
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Theories of Automatic Structures and Their Complexity
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Automatic presentations for semigroups
Information and Computation
Upper bounds for a theory of queues
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Model theoretic complexity of automatic structures
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Unary automatic graphs: an algorithmic perspective
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Automatic structures of bounded degree revisited
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Uncountable automatic classes and learning
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
Fundamenta Informaticae
Ehrenfeucht--Fraïssé goes automatic for real addition
Information and Computation
The isomorphism problem for ω-automatic trees
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Cellular Automata, Decidability and Phasespace
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Deciding the isomorphism problem in classes of unary automatic structures
Theoretical Computer Science
Uncountable automatic classes and learning
Theoretical Computer Science
Effectively reasoning about infinite sets in answer set programming
Logic programming, knowledge representation, and nonmonotonic reasoning
Automatic structures and groups
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Automatic learning of subclasses of pattern languages
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Logic and games on automatic structures: playing with quantifiers and decompositions
Logic and games on automatic structures: playing with quantifiers and decompositions
Size and computation of injective tree automatic presentations
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Automatic learners with feedback queries
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Regular growth automata: properties of a class of finitely induced infinite machines
MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
Robust learning of automatic classes of languages
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
Invariants of automatic presentations and semi-synchronous transductions
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
First-order and counting theories of ω-automatic structures
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Game quantification on automatic structures and hierarchical model checking games
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Automatic presentations for finitely generated groups
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Policy monitoring in first-order temporal logic
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Decidability of term algebras extending partial algebras
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
The modular decomposition of countable graphs: constructions in monadic second-order logic
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Decidability and complexity in automatic monoids
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Learnability of automatic classes
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Where automatic structures benefit from weighted automata
Algebraic Foundations in Computer Science
Cayley graph automatic groups are not necessarily cayley graph biautomatic
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Automaton ranks of some self-similar groups
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Interpretations in Trees with Countably Many Branches
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Prefix rewriting for nested-words and collapsible pushdown automata
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Iterating invertible binary transducers
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
The mate-in-n problem of infinite chess is decidable
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Automatic functions, linear time and learning
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Word automaticity of tree automatic scattered linear orderings is decidable
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Tree-Automatic well-founded trees
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Learnability of automatic classes
Journal of Computer and System Sciences
Automatic learning of subclasses of pattern languages
Information and Computation
Traces of term-automatic graphs
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Automatic learning from positive data and negative counterexamples
ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
Invertible transducers, iteration and coordinates
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Automatic learners with feedback queries
Journal of Computer and System Sciences
Robust learning of automatic classes of languages
Journal of Computer and System Sciences
Computable fixpoints in well-structured symbolic model checking
Formal Methods in System Design
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |