Size-time complexity of Boolean networks for prefix computations
Journal of the ACM (JACM)
A hierarchy of temporal properties (invited paper, 1989)
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Noncounting Context-Free Languages
Journal of the ACM (JACM)
Inference of Reversible Languages
Journal of the ACM (JACM)
Existential second-order logic over strings
Journal of the ACM (JACM)
MSO definable string transductions and two-way finite-state transducers
ACM Transactions on Computational Logic (TOCL)
On first-order topological queries
ACM Transactions on Computational Logic (TOCL)
Associative language descriptions
Theoretical Computer Science
Learning Locally Testable Even Linear Languages from Positive Data
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Linear Temporal Logic and Finite Semigroups
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Characterizing Simpler Recognizable Sets of Integers
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Complete and Tractable Local Linear Time Temporal Logics over Traces
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Many Faces of a Translation
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
On Logical Descriptions of Regular Languages
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Model Checking: A Tutorial Overview
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
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
A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
A Further Step towards a Theory of Regular MSC Languages
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Expressive Power of Temporal Logics
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Locality, Reversibility, and Beyond: Learning Languages from Positive Data
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Shuffle Quotient and Decompositions
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Level 5/2 of the Straubing-Thérien Hierarchy for Two-Letter Alphabets
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Splicing Systems: Regularity and Below
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Piecewise and Local Threshold Testability of DFA
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Model checking: a tutorial overview
Modeling and verification of parallel processes
Typechecking XML views of relational databases
ACM Transactions on Computational Logic (TOCL)
Towards a language theory for infinite N-free pomsets
Theoretical Computer Science
Bilateral locally testable languages
Theoretical Computer Science
Counting Modulo Quantifiers on Finite Linearly Ordered Trees
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
An Until Hierarchy for Temporal Logic
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
On First-Order Topological Queries
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Computational parallels between the regular and context-free languages
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
On the time and tape complexity of languages I
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Unbounded fan-in circuits and associative functions
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A complexity theory of grammar problems
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
Counting on CTL: on the expressive power of monadic path logic
Information and Computation
Definable relations and first-order query languages over strings
Journal of the ACM (JACM)
Regular sets of infinite message sequence charts
Information and Computation
Vectorial languages and linear temporal logic
Theoretical Computer Science
Natural languages and the Chomsky hierarchy
EACL '85 Proceedings of the second conference on European chapter of the Association for Computational Linguistics
Reducing the time complexity of testing for local threshold testability
Theoretical Computer Science - Implementation and application of automata
A characterization of first-order topological properties of planar spatial data
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Describing syntax with star-free regular expressions
EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
The structure of reflexive regular splicing languages via Schützenberger constants
Theoretical Computer Science
Information and Computation
Algebraic recognizability of regular tree languages
Theoretical Computer Science - The art of theory
Quasi-star-free languages on infinite words
Acta Cybernetica
A reducibility for the dot-depth hierarchy
Theoretical Computer Science - Mathematical foundations of computer science 2004
A characterization of first-order topological properties of planar spatial data
Journal of the ACM (JACM)
Linear splicing and syntactic monoid
Discrete Applied Mathematics
Characterizing CTL-like logics on finite trees
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Learning in varieties of the form V*LI from positive data
Theoretical Computer Science
Languages polylog-time reducible to dot-depth 1/2
Journal of Computer and System Sciences
Expressiveness and complexity of graph logic
Information and Computation
Pure future local temporal logics are expressively complete for Mazurkiewicz traces
Information and Computation
Classifying regular languages by a split game
Theoretical Computer Science
Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics
Fundamenta Informaticae
Effective characterizations of tree logics
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Circuit Complexity of Regular Languages
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
25 Years of Model Checking
The Algebraic Counterpart of the Wagner Hierarchy
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
On Second-Order Monadic Groupoidal Quantifiers
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Synchronizing Automata and the Černý Conjecture
Language and Automata Theory and Applications
Characterization of Logics over Ranked Tree Languages
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Learning Left-to-Right and Right-to-Left Iterative Languages
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Learning Context-Sensitive Languages from Linear Structural Information
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
A Unified Model Checking Approach with Projection Temporal Logic
ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
From Philosophical to Industrial Logics
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
Descriptional and Computational Complexity of Finite Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
New Morphic Characterizations of Languages in Chomsky Hierarchy Using Insertion and Locality
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Regular tree languages definable in FO and in FOmod
ACM Transactions on Computational Logic (TOCL)
Formal language characterizations of P, NP, and Pspace
Journal of Automata, Languages and Combinatorics
Extended temporal logic on finite words and wreath product of monoids with distinguished generators
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Decision problems for linear and circular splicing systems
DLT'02 Proceedings of the 6th international conference on Developments in language theory
A polynomial time algorithm for left [right] local testability
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
A package TESTAS for checking some kinds of testability
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Regular languages generated by reflexive finite splicing systems
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Reducing the time complexity of testing for local threshold testability
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Classifying discrete temporal properties
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
The descriptive complexity approach to LOGCFL
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
A star operation for star-free trace languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Fine hierarchy of regular aperiodic ω-languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Synchronizing automata preserving a chain of partial orders
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Counter-free input-determined timed automata
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
From LTL to symbolically represented deterministic automata
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Propositional projection temporal logic, Büchi automata and ω-regular expressions
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Pillars of computer science
Logic and rational languages of words indexed by linear orderings
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Relational properties expressible with one universal quantifier are testable
SAGA'09 Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications
On the Krohn-Rhodes cascaded decomposition theorem
Time for verification
Other complexity classes and measures
Algorithms and theory of computation handbook
On languages piecewise testable in the strict sense
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
Formal parameters of phonology: from government phonology to SPE
ESSLLI'08/09 Proceedings of the 2008 international conference on Interfaces: explorations in logic, language and computation
Automata vs. logics on data words
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
A transformation from PPTL to S1S
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Morphic characterizations of languages in Chomsky hierarchy with insertion and locality
Information and Computation
Extensional Uniformity for Boolean Circuits
SIAM Journal on Computing
Complexity of fairness constraints for the Dolev-Yao attacker model
Proceedings of the 2011 ACM Symposium on Applied Computing
The model checking problem for prefix classes of second-order logic: a survey
Fields of logic and computation
Formal and empirical grammatical inference
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Tutorial Abstracts of ACL 2011
Untestable properties in the kahr-moore-wang class
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
An algebraic characterization of strictly piecewise languages
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Theme and variations on the concatenation product
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Green's relations and their use in automata theory
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Morphic characterizations in terms of insertion systems with a context of length one
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Nondeterministic state complexity of star-free languages
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
On the use of guards for logics with data
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Splicing systems: accepting versus generating
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
On locally checkable properties
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Real time temporal logic: past, present, future
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Weighted automata and weighted logics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Restricted two-variable FO + MOD sentences, circuits and communication complexity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On the expressiveness of MTL with past operators
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Schützenberger and eilenberg theorems for words on linear orderings
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Polylog-time reductions decrease dot-depth
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Regular tree languages definable in FO
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Asynchronous automata-theoretic characterization of aperiodic trace languages
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Complementation of rational sets on countable scattered linear orderings
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Operator precedence and the visibly pushdown property
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Recombinant DNA ,gene splicing as generative devices of formal languages
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Some reducibilities on regular sets
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Compiling simple context restrictions with nondeterministic automata
FSMNLP '11 Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing
Effective characterizations of simple fragments of temporal logic using prophetic automata
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Where First-Order and Monadic Second-Order Logic Coincide
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Regular languages of infinite trees that are boolean combinations of open sets
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Rough Approximations in Varieties of Regular Languages
Fundamenta Informaticae
Syntactic complexities of some classes of star-free languages
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics
Fundamenta Informaticae
On the Shuffle of Star-Free Languages
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Structure theorem and strict alternation hierarchy for FO2 on words
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
In search of most complex regular languages
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Strict local testability with consensus equals regularity
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Enforceable Security Policies Revisited
ACM Transactions on Information and System Security (TISSEC)
Deterministic counter machines and parallel matching computations
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Linear temporal logic and linear dynamic logic on finite traces
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.01 |