I-regular expression: regular expression with continuous interval constraints
CIKM '97 Proceedings of the sixth international conference on Information and knowledge management
Constraints in computational logics
Subset construction complexity for homogeneous automata, position automata and ZPC-structures
Theoretical Computer Science
ACM SIGMOD Record
A unified language processing methodology
Theoretical Computer Science
Checking Simple Properties of Transition Systems Defined by Thue Specifications
Journal of Automated Reasoning
interactions - Winds of change
A non-ambiguous decomposition of regular languages and factorizing codes
Discrete Applied Mathematics
Regularity of Congruential Graphs
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Determinization of Glushkov Automata
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Description logics for semantic query optimization in object-oriented database systems
ACM Transactions on Database Systems (TODS)
Development reuse and the logic program derivation of two string-matching algorithms
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Theoretical Computer Science - Latin American theoretical informatics
On images of DOL and DTOL power series
Theoretical Computer Science
Optimal insertion in deterministic DAWGs
Theoretical Computer Science
Finite-state transducers in language and speech processing
Computational Linguistics
On some applications of finite-state automata theory to natural language processing
Natural Language Engineering
Enumerating the strings of regular languages
Journal of Functional Programming
Acyclic networks maximizing the printing complexity
Theoretical Computer Science - Implementation and application of automata
Encyclopedia of Computer Science
Deciding Regular Grammar Logics with Converse Through First-Order Logic
Journal of Logic, Language and Information
The structure of reflexive regular splicing languages via Schützenberger constants
Theoretical Computer Science
Regular splicing languages and subclasses
Theoretical Computer Science - The art of theory
Parsing with a finite dictionary
Theoretical Computer Science - The art of theory
Quasi-star-free languages on infinite words
Acta Cybernetica
Linear splicing and syntactic monoid
Discrete Applied Mathematics
Inductive bases and their application to searches for minimal unary NFAs
Proceedings of the 44th annual Southeast regional conference
On the power of circular splicing
Discrete Applied Mathematics - Special issue: Max-algebra
Journal of Computer and System Sciences
Star-free Star and Trace Languages
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Kernel methods for learning languages
Theoretical Computer Science
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Matching Trace Patterns with Regular Policies
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
On the power of circular splicing
Discrete Applied Mathematics
Linear splicing and syntactic monoid
Discrete Applied Mathematics
A probabilistic approach to navigation in Hypertext
Information Sciences: an International Journal
Decision problems for linear and circular splicing systems
DLT'02 Proceedings of the 6th international conference on Developments in language theory
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Regular languages generated by reflexive finite splicing systems
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Running time complexity of printing an acyclic automaton
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Modular specification and verification of object-oriented programs
Modular specification and verification of object-oriented programs
A star operation for star-free trace languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Numeration systems: a link between number theory and formal language theory
DLT'10 Proceedings of the 14th international conference on Developments in language theory
DLT'10 Proceedings of the 14th international conference on Developments in language 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
Describing periodicity in two-way deterministic finite automata using transformation semigroups
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Clausal Tableaux for Hybrid PDL
Electronic Notes in Theoretical Computer Science (ENTCS)
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
XML type checking using high-level tree transducer
FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
Quotient complexity of ideal languages
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Schützenberger and eilenberg theorems for words on linear orderings
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
The generalization of generalized automata: expression automata
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
A decision procedure for reflexive regular splicing languages
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
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
Star-free Star and Trace Languages
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Thue Specifications and Their Monadic Second-order Properties
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
A Note on the Logical Definability of Rational Trace Languages
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Quotient complexity of ideal languages
Theoretical Computer Science
Computable fixpoints in well-structured symbolic model checking
Formal Methods in System Design
Hi-index | 0.01 |