MSO definable string transductions and two-way finite-state transducers
ACM Transactions on Computational Logic (TOCL)
Minimal cover-automata for finite languages
Theoretical Computer Science
Subset construction complexity for homogeneous automata, position automata and ZPC-structures
Theoretical Computer Science
Monadic datalog and the expressive power of languages for web information extraction
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Error-detecting properties of languages
Theoretical Computer Science
Checking MSC specifications for timing inconsistency
Journal of Computer Science and Technology
Canonical derivatives, partial derivatives and finite automaton constructions
Theoretical Computer Science
The finite power problem revisited
Information Processing Letters
Tight lower bound for the state complexity of shuffle of regular languages
Journal of Automata, Languages and Combinatorics
Some Classes of Regular Languages Identifiable in the Limit from Positive Data
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Algebraic Rewritings for Optimizing Regular Path Queries
ICDT '01 Proceedings of the 8th International Conference on Database Theory
New Rewritings and Optimizations for Regular Path Queries
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Applications of Finite Automata
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Algorithms for Computing Small NFAs
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Finite Automata with Generalized Acceptance Criteria
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Residual Finite State Automata
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Fast Algorithms for Extended Regular Expression Matching and Searching
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Determinization of Glushkov Automata
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
State Complexity of Basic Operations on Finite Languages
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Implicit Structures to Implement NFA's from Regular Expressions
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
New Finite Automaton Constructions Based on Canonical Derivatives
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Brzozowski's Derivatives Extended to Multiplicities
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Learning Regular Languages Using RFSA
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Shuffle Quotient and Decompositions
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
Computing the Equation Automaton of a Regular Expression in Space and Time
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Constructing NFA s by Optimal Use of Positions in Regular Expressions
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
State and Transition Complexity of Watson-Crick Finite Automata
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
On the Complexity of Decidable Cases of Commutation Problem for Languages
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Well-abstracted transition systems: application to FIFO automata
Information and Computation
Theoretical Computer Science - Mathematical foundations of computer science
Query containment and rewriting using views for regular path queries under constraints
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
State complexity of proportional removals
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
A recognition and parsing algorithm for arbitrary conjunctive grammars
Theoretical Computer Science
Journal of Automata, Languages and Combinatorics
Theoretical study and implementation of the canonical automaton
Fundamenta Informaticae
Reducing NFAs by invariant equivalences
Theoretical Computer Science
Information and Computation
Monadic datalog and the expressive power of languages for Web information extraction
Journal of the ACM (JACM)
Efficient Incremental Validation of XML Documents
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Learning regular languages using RFSAs
Theoretical Computer Science - Special issue: Algorithmic learning theory
Derivatives of rational expressions and related theorems
Theoretical Computer Science - Implementation and application automata
Trajectory-based embedding relations
Fundamenta Informaticae
Real numbers having ultimately periodic representations in abstract numeration systems
Information and Computation
Theoretical Computer Science
On the state complexity of reversals of regular languages
Theoretical Computer Science
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
Information and Computation
Deleting string rewriting systems preserve regularity
Theoretical Computer Science - Developments in language theory
Minimizing finite automata is computationally hard
Theoretical Computer Science - Developments in language theory
Language equations, maximality and error-detection
Journal of Computer and System Sciences
Pattern expressions and pattern automata
Information Processing Letters
Theoretical Computer Science - Descriptional complexity of formal systems
On the descriptional complexity of finite automata with modified acceptance conditions
Theoretical Computer Science - Descriptional complexity of formal systems
State complexity of some operations on binary regular languages
Theoretical Computer Science - Descriptional complexity of formal systems
Theoretical Computer Science - Insightful theory
On properties of bond-free DNA languages
Theoretical Computer Science
On the complexity of decidable cases of the commutation problem of languages
Theoretical Computer Science
Economy of description for basic constructions on rational transductions
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
The maximum state complexity for finite languages
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Random generation models for NFA'S
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
State complexity of shuffle on trajectories
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Parsing with a finite dictionary
Theoretical Computer Science - The art of theory
Decidability of trajectory-based equations
Theoretical Computer Science - Mathematical foundations of computer science 2004
Theoretical Computer Science - Mathematical foundations of computer science 2004
Unresolved systems of language equations: expressive power and decision problems
Theoretical Computer Science
From Mirkin's Prebases to Antimirov's Word Partial Derivatives
Fundamenta Informaticae
Residual Finite State Automata
Fundamenta Informaticae
Results on Transforming NFA into DFCA
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
New Iteration Lemmata for Regular Languages
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
State Complexity: Recent Results and Open Problems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Automata Recognizing No Words: A Statistical Approach
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Block Substitutions and Their Properties
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Algebraic properties of substitution on trajectories
Theoretical Computer Science
Computing the edit distance of a regular language
Information and Computation
State complexity of combined operations
Theoretical Computer Science
Determinization of fuzzy automata with membership values in complete residuated lattices
Information Sciences: an International Journal
On the existence of regular approximations
Theoretical Computer Science
On the average state and transition complexity of finite languages
Theoretical Computer Science
Towards practically feasible answering of regular path queries in lav data integration
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Prefix-free regular languages and pattern matching
Theoretical Computer Science
Some succinctness properties of Ω-DTAFA
SEPADS'06 Proceedings of the 5th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems
The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal
Fundamenta Informaticae
Fast equation automaton computation
Journal of Discrete Algorithms
State complexity of basic language operations combined with reversal
Information and Computation
Deterministic Simulation of a NFA with k---Symbol Lookahead
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Nondeterministic Finite Automata--Recent Results on the Descriptional and Computational Complexity
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Hopcroft's Minimization Technique: Queues or Stacks?
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Inclusion Test Algorithms for One-Unambiguous Regular Expressions
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Succinctness of Regular Expressions with Interleaving, Intersection and Counting
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Finite Automata, Palindromes, Powers, and Patterns
Language and Automata Theory and Applications
On the State Complexity of Complements, Stars, and Reversals of Regular Languages
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Learning deterministically recognizable tree series
Journal of Automata, Languages and Combinatorics
A family of NFAS free of state reductions
Journal of Automata, Languages and Combinatorics
Enumeration of context-free languages and related structures
Journal of Automata, Languages and Combinatorics
A New Family of Regular Operators Fitting with the Position Automaton Computation
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Maximal error-detecting capabilities of formal languages
Journal of Automata, Languages and Combinatorics
State Complexity of Nested Word Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Multi-tilde Operators and Their Glushkov Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
On the intersection of regex languages with regular languages
Theoretical Computer Science
On the Hopcroft's minimization technique for DFA and DFCA
Theoretical Computer Science
State complexity of unique rational operations
Theoretical Computer Science
State complexity of basic operations on suffix-free regular languages
Theoretical Computer Science
Estimation of state complexity of combined operations
Theoretical Computer Science
Operational state complexity of nested word automata
Theoretical Computer Science
On the synchronized derivation depth of context-free grammars
Theoretical Computer Science
Small Extended Expressions for Acyclic Automata
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Concatenation of Regular Languages and Descriptional Complexity
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Deciding determinism of caterpillar expressions
Theoretical Computer Science
Backward and forward bisimulation minimization of tree automata
Theoretical Computer Science
Detecting palindromes, patterns and borders in regular languages
Information and Computation
Information and Computation
Pattern expressions and pattern automata
Information Processing Letters
Myhill--Nerode type theory for fuzzy languages and automata
Fuzzy Sets and Systems
The number of similarity relations and the number of minimal deterministic finite cover automata
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
State complexity of basic operations on nondeterministic finite automata
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Complexity theory made easy: the formal language approach to the definition of complexity classes
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Deleting string rewriting systems preserve regularity
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Minimizing finite automata is computationally hard
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Verification of data paths using unbounded integers: automata strike back
HVC'06 Proceedings of the 2nd international Haifa verification conference on Hardware and software, verification and testing
Some undecidability results related to the star problem in trace monoids
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Inapproximability of nondeterministic state and transition complexity assuming P ≠ NP
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Deterministic blow-ups of minimal nondeterministic finite automata over a fixed alphabet
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Time and alternation: an automata based framework to software model checking
Proceedings of the 2010 ACM Symposium on Applied Computing
Deterministic caterpillar expressions
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
DNA coding using the subword closure operation
DNA13'07 Proceedings of the 13th international conference on DNA computing
Succinctness of regular expressions with interleaving, intersection and counting
Theoretical Computer Science
Fuzzy relation equations and reduction of fuzzy automata
Journal of Computer and System Sciences
Acyclic automata and small expressions using multi-tilde-bar operators
Theoretical Computer Science
Complexity in union-free regular languages
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Computing Maximal Error-detecting Capabilities and Distances of Regular Languages
Fundamenta Informaticae
Satisfiability and containment problem of structural recursions with conditions
ADBIS'10 Proceedings of the 14th east European conference on Advances in databases and information systems
Block insertion and deletion on trajectories
Theoretical Computer Science
Limitations of lower bound methods for deterministic nested word automata
Information and Computation
One-reversal counter machines and multihead automata: revisited
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
State complexity of catenation combined with union and intersection
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Types of trusted information that make DFA identification with correction queries feasible
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
What is a maximal error-detecting capability of a formal language?
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
On nondeterministic workflow executions
WS-FM'10 Proceedings of the 7th international conference on Web services and formal methods
On language decompositions and primality
Rainbow of computer science
Descriptional complexity of unambiguous nested word automata
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
State complexity research and approximation
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
State complexity of four combined operations composed of union, intersection, star and reversal
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
State complexity of projected languages
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Note on reversal of binary regular languages
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
State trade-offs in unranked tree automata
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Some variants of the star height problem
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Computing maximal Kleene closures that are embeddable in a given constrained DNA language
DNA'11 Proceedings of the 17th international conference on DNA computing and molecular programming
Tree transformations and dependencies
MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
Succinctness of the Complement and Intersection of Regular Expressions
ACM Transactions on Computational Logic (TOCL)
On the state complexity of combined operations
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Quotient complexity of ideal languages
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Reducing the size of NFAs by using equivalences and preorders
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Lower bounds for the transition complexity of NFAs
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Consistency of XML specifications
Inconsistency Tolerance
Computing the follow automaton of an expression
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
State complexity of concatenation and complementation of regular languages
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Tight bounds for NFA to DFCA transformations for binary alphabets
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Semantic shuffle on and deletion along trajectories
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Efficient incremental validation of XML documents after composite updates
XSym'06 Proceedings of the 4th international conference on Database and XML Technologies
State complexity of union and intersection of star on k regular languages
Theoretical Computer Science
Prime decompositions of regular languages
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
On weakly ambiguous finite transducers
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
An incremental algorithm for constructing minimal deterministic finite cover automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Basic operations on binary suffix-free languages
MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
Derivatives of regular expressions and an application
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
State complexity of kleene-star operations on trees
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
State complexity of combined operations with two basic operations
Theoretical Computer Science
Reversal of binary regular languages
Theoretical Computer Science
Nondeterministic state complexity of star-free languages
Theoretical Computer Science
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Transformations Between Different Models of Unranked Bottom-Up Tree Automata
Fundamenta Informaticae
Transition Complexity of Incomplete DFAs
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Rough Approximations in Varieties of Regular Languages
Fundamenta Informaticae
On inverse operations and their descriptional complexity
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Descriptional complexity of biautomata
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Descriptional complexity of pushdown store languages
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
State complexity and limited nondeterminism
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
State complexity of projection and quotient on unranked trees
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Inside the class of REGEX languages
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Regular and context-free pattern languages over small alphabets
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
The state complexity of star-complement-star
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal
Fundamenta Informaticae
Automata Recognizing No Words: A Statistical Approach
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Block Substitutions and Their Properties
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Algorithmic decomposition of shuffle on words
Theoretical Computer Science
State complexity of union and intersection of square and reversal on k regular languages
Theoretical Computer Science
Results on Transforming NFA into DFCA
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
New Iteration Lemmata for Regular Languages
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
State Complexity: Recent Results and Open Problems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Trajectory-Based Embedding Relations
Fundamenta Informaticae
Residual Finite State Automata
Fundamenta Informaticae
From Mirkin's Prebases to Antimirov's Word Partial Derivatives
Fundamenta Informaticae
State Complexity of Combined Operations with Union, Intersection, Star and Reversal
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Mirror Images and Schemes for the Maximal Complexity of Nondeterminism
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Sheng Yu (1950-2012) In Memoriam
Fundamenta Informaticae
State complexity of basic operations on suffix-free regular languages
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Hyper-minimization for deterministic tree automata
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
On properties and state complexity of deterministic state-partition automata
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
On union-free and deterministic union-free languages
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Quotient complexity of ideal languages
Theoretical Computer Science
Computing maximal Kleene closures that are embeddable in a given subword-closed language
Natural Computing: an international journal
State complexity of star of union and square of union on k regular languages
Theoretical Computer Science
State succinctness of two-way finite automata with quantum and classical states
Theoretical Computer Science
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
On the boundary of regular languages
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Hyper-optimization for deterministic tree automata
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Incomplete transition complexity of basic operations on finite languages
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Equivalence of extended symbolic finite transducers
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Nondeterministic automata: Equivalence, bisimulations, and uniform relations
Information Sciences: an International Journal
Regular and context-free pattern languages over small alphabets
Theoretical Computer Science
| Hi-index | 0.04 |