Algebraic tools for the concatenation product
Theoretical Computer Science
Syntactic Semiring of a Language
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Decidable Hierarchies of Starfree Languages
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Fast Implementations of Automata Computations
CIAA '00 Revised Papers from the 5th 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
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
Some Regular Languages That Are Church-Rosser Congruential
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A solution to the problem of (A,B)-invariance for series
Theoretical Computer Science
Vectorial languages and linear temporal logic
Theoretical Computer Science
Shuffle on positive varieties of languages
Theoretical Computer Science
From cascade decompositions to bit-vector algorithms
Theoretical Computer Science - Implementation and application automata
On definite and nilpotent DR tree languages
Journal of Automata, Languages and Combinatorics
On the trace product and some families of languages closed under partial commutations
Journal of Automata, Languages and Combinatorics
Bimachines and structurally-reversed automata
Journal of Automata, Languages and Combinatorics
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
Unresolved systems of language equations: expressive power and decision problems
Theoretical Computer Science
Routes and Products of Monoids
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Small conjunctive varieties of regular languages
Acta Cybernetica
Complementation of rational sets on scattered linear orderings of finite rank
Theoretical Computer Science
The size of Higman-Haines sets
Theoretical Computer Science
Complexity of Topological Properties of Regular ω-Languages
Fundamenta Informaticae
Circuit Complexity of Regular Languages
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
A Robust Class of Regular Languages
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent Groups
Language and Automata Theory and Applications
Spider Diagrams of Order and a Hierarchy of Star-Free Regular Languages
Diagrams '08 Proceedings of the 5th international conference on Diagrammatic Representation and Inference
On the Non-deterministic Communication Complexity of Regular Languages
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Hierarchies of Piecewise Testable Languages
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Complexity of Topological Properties of Regular ω-Languages
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Learning Commutative Regular Languages
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Theoretical Computer Science
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
Polynomial Operators on Classes of Regular Languages
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
A counterexample to a conjecture concerning concatenation hierarchies
Information Processing Letters
Myhill--Nerode type theory for fuzzy languages and automata
Fuzzy Sets and Systems
Syntactic semiring and universal automaton
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Languages with bounded multiparty communication complexity
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
On Schützenberger products of semirings
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Languages recognized by finite supersoluble groups
Journal of Automata, Languages and Combinatorics
Varieties of recognizable tree series over fields
Theoretical Computer Science
Proceedings of the 14th International Conference on Database Theory
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
Classifying regular languages via cascade products of automata
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Syntactic complexity of ultimately periodic sets of integers
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Syntactic complexity of Prefix-, Suffix-, and Bifix-free regular languages
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Bisimulations for fuzzy automata
Fuzzy Sets and Systems
Restricted two-variable FO + MOD sentences, circuits and communication complexity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
An algebraic point of view on the crane beach property
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Schützenberger and eilenberg theorems for words on linear orderings
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Piecewise FIFO channels are analyzable
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Composition and decomposition in true-concurrency
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
C-varieties, actions and wreath product
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Conservative groupoids recognize only regular languages
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
Theoretical Computer Science
Rough Approximations in Varieties of Regular Languages
Fundamenta Informaticae
Descriptional complexity of biautomata
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Biautomata for k-piecewise testable languages
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Complexity of Topological Properties of Regular ω-Languages
Fundamenta Informaticae
Routes and Products of Monoids
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
On the Shuffle of Star-Free Languages
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Syntactic Complexity of Ultimately Periodic Sets of Integers and Application to a Decision Procedure
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
In search of most complex regular languages
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
On completeness of omega-regular algebras
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
On simplification of schema mappings
Journal of Computer and System Sciences
On the expressiveness of spider diagrams and commutative star-free regular languages
Journal of Visual Languages and Computing
Algebras, automata and logic for languages of labeled birooted trees
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Varieties and Covarieties of Languages (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.01 |