Finite monoids and the fine structure of NC1
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Finite monoids and the fine structure of NC1
Journal of the ACM (JACM)
A constraint satisfaction approach to operative management of aircraft routing
IEA/AIE '90 Proceedings of the 3rd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 2
On the determination of Green's relations in finite transformation semigroups
Journal of Symbolic Computation
The membership problem in aperiodic transformation monoids
Journal of the ACM (JACM)
Logical models of objects and of processes
ANSS '91 Proceedings of the 24th annual symposium on Simulation
CSC '91 Proceedings of the 19th annual conference on Computer Science
Model-checking infinite state-space systems with fine-grained abstractions using SPIN
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
On the support of graph Lie algebras
Theoretical Computer Science
Rétractions, Corétractions et enveloppe injective d'une algèbre de transitions
Discrete Mathematics
The parallel complexity of deterministic and probabilistic automata
Journal of Automata, Languages and Combinatorics
Determinization of transducers over finite and infinite words
Theoretical Computer Science
Extensions and submonoids of automatic monoids
Theoretical Computer Science
Algebraic tools for the concatenation product
Theoretical Computer Science
Inferring Subclasses of Regular Languages Faster Using RPNI and Forbidden Configurations
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Linear Temporal Logic and Finite Semigroups
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Syntactic Semiring of a Language
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Satisfiability of Systems of Equations over Finite Monoids
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
An Algebraic Framework for Abstract Model Checking
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
The Many Faces of a Translation
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
On the Complexity of Free Monoid Morphisms
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Weakly Iterated Block Products of Finite Monoids
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
On Logical Descriptions of Regular Languages
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Nesting Until and Since in Linear Temporal Logic
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Compositional Termination Analysis of Symbolic Forward Analysis
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Algebraic Characterizations of Small Classes of Boolean Functions
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A Generalized Quantifier Concept in Computational Complexity Theory
ESSLLI '97 Revised Lectures from the 9th European Summer School on Logic, Language, and Information: Generalized Quantifiers and Computation
Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Decidable Hierarchies of Starfree Languages
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Scheduling Hard Sporadic Tasks by Means of Finite Automata and Generating Functions
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Partially-Ordered Two-Way Automata: A New Characterization of DA
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Valuated and Valence Grammars: An Algebraic View
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Elementary Theory of Ordinals with Addition and Left Translation by omega
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Equation Satisfiability and Program Satisfiability for Finite Monoids
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
The computing power of programs over finite monoids
Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
Storeless semantics and alias logic
Proceedings of the 2003 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Bilateral locally testable languages
Theoretical Computer Science
Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata
Theoretical Computer Science
Deciding whether the frontier of a regular tree is scattered
Fundamenta Informaticae
Minimal schedulability interval for real-time systems of periodic tasks with offsets
Theoretical Computer Science
Finite-state transducers in language and speech processing
Computational Linguistics
An efficient compiler for weighted rewrite rules
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Journal of Automata, Languages and Combinatorics
Encyclopedia of Computer Science
Varieties of tree languages definable by syntactic monoids
Acta Cybernetica
Quasi-star-free languages on infinite words
Acta Cybernetica
Cycle structure in automata and the holonomy decomposition
Acta Cybernetica
Learning expressions and programs over monoids
Information and Computation
Actions, wreath products of C-varieties and concatenation product
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Characterizing CTL-like logics on finite trees
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Constructing divisions into power groups
Theoretical Computer Science
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
An Automata Description of the Genetic Message Translation
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Characterizations of recognizable picture series
Theoretical Computer Science
Regular tree languages and quasi orders
Acta Cybernetica
The growth ratio of synchronous rational relations is unique
Theoretical Computer Science
Polynomials, fragments of temporal logic and the variety DA over traces
Theoretical Computer Science
Two algebraic approaches to variants of the concatenation product
Theoretical Computer Science
Fundamental study: Tree algebras and varieties of tree languages
Theoretical Computer Science
Q-Automata: Modelling the Resource Usage of Concurrent Components
Electronic Notes in Theoretical Computer Science (ENTCS)
WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model
Theoretical Computer Science
On First-Order Fragments for Mazurkiewicz Traces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics
Fundamenta Informaticae
Note: Schützenberger's theorem on formal power series follows from Kleene's theorem
Theoretical Computer Science
Weighted automata with discounting
Information Processing Letters
Duality and Equational Theory of Regular Languages
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
3-Way Composition of Weighted Finite-State Transducers
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
A Robust Class of Regular Languages
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Subsequence Counting, Matrix Representations and a Theorem of Eilenberg
Language and Automata Theory and Applications
Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent Groups
Language and Automata Theory and Applications
Hierarchies of Piecewise Testable Languages
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Subword histories and associated matrices
Theoretical Computer Science
Testing Non-deterministic Stream X-machine Models and P systems
Electronic Notes in Theoretical Computer Science (ENTCS)
M-solid varieties of languages
Acta Cybernetica
Descriptional and Computational Complexity of Finite Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
A Kleene Theorem for Forest Languages
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Fuzzy homomorphisms of algebras
Fuzzy Sets and Systems
Faithful Loops for Aperiodic E-Ordered Monoids
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
A Testing Framework for Finite-State Morphology
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Algebra for Infinite Forests with an Application to the Temporal Logic EF
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
An Eilenberg Theorem for Pictures
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Polynomial Operators on Classes of Regular Languages
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
On locally reversible languages
Theoretical Computer Science
Weighted finite automata over strong bimonoids
Information Sciences: an International Journal
Fuzzy tree language recognizability
Fuzzy Sets and Systems
Arithmetic Meyer sets and finite automata
Information and Computation
Learning expressions and programs over monoids
Information and Computation
On some questions of rationality and decidability
Journal of Computer and System Sciences
Linear dynamical systems over integral domains
Journal of Computer and System Sciences
The many faces of a translation
Journal of Computer and System Sciences
Criteria for the matrix equivalence of words
Theoretical Computer Science
Myhill--Nerode type theory for fuzzy languages and automata
Fuzzy Sets and Systems
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
Some remarks on asynchronous automata
DLT'02 Proceedings of the 6th international conference on Developments in language theory
On a conjecture of schnoebelen
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Locally commutative categories
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Where do unit tests come from?
XP'03 Proceedings of the 4th international conference on Extreme programming and agile processes in software engineering
Learning languages with rational kernels
COLT'07 Proceedings of the 20th annual conference on Learning theory
On first-order fragments for words and Mazurkiewicz traces: a survey
DLT'07 Proceedings of the 11th international conference on Developments in language theory
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Subword balance, position indices and power sums
Journal of Computer and System Sciences
The expressive power of the shuffle product
Information and Computation
On the Krohn-Rhodes cascaded decomposition theorem
Time for verification
Languages recognized by finite supersoluble groups
Journal of Automata, Languages and Combinatorics
Varieties of recognizable tree series over fields
Theoretical Computer Science
Descriptional and computational complexity of finite automata---A survey
Information and Computation
Codes base on unambiguous products
ICCCI'10 Proceedings of the Second international conference on Computational collective intelligence: technologies and applications - Volume Part III
Regular geometrical languages and tiling the plane
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Theme and variations on the concatenation product
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Typed monoids: an Eilenberg-like theorem for non regular languages
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Geometrical regular languages and linear diophantine equations
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Quantum finite automata and probabilistic reversible automata: R-trivial idempotent languages
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
A protein substructure based p system for description and analysis of cell signalling networks
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Groupoids that recognize only regular languages
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Schützenberger and Eilenberg theorems for words on linear orderings
Journal of Computer and System Sciences
Quantum finite automata and logics
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Algebraic and coalgebraic aspects of membrane computing
WMC'05 Proceedings of the 6th international conference on Membrane Computing
On the computation of some standard distances between probabilistic automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
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
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Regular languages, unambiguous concatenation and computational complexity
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Geometricity of binary regular languages
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Polynomials, fragments of temporal logic and the variety DA over traces
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Perfect correspondences between dot-depth and polynomial-time hierarchy
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
C-varieties, actions and wreath product
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Efficient computation of the relative entropy of probabilistic automata
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Decomposition of constraint automata
FACS'10 Proceedings of the 7th international conference on Formal Aspects of Component Software
Recent results on syntactic groups of prefix codes
European Journal of Combinatorics
Functional models of neurobiological processes
Mathematical and Computer Modelling: An International Journal
Algebraic analysis of the computation in the belousov-zhabotinksy reaction
IPCAT'12 Proceedings of the 9th international conference on Information Processing in Cells and Tissues
Geometrical regular languages and linear Diophantine equations: The strongly connected case
Theoretical Computer Science
Lattices of logical fragments over words
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
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Learning in the limit with lattice-structured hypothesis spaces
Theoretical Computer Science
On First-Order Fragments for Mazurkiewicz Traces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
The join levels of the trotter-weil hierarchy are decidable
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
An Automata Description of the Genetic Message Translation
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Deciding whether the frontier of a regular tree is scattered
Fundamenta Informaticae
The Block Product of Categories and Tilson's Division
Fundamenta Informaticae
The Kernel of a Relational Morphism of Categories
Fundamenta Informaticae
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
The Krohn-Rhodes Theorem and Local Divisors
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Varieties and Covarieties of Languages (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
A noncommutative extension of Mahler's theorem on interpolation series
European Journal of Combinatorics
Iterated periodicity over finite aperiodic semigroups
European Journal of Combinatorics
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.02 |