Typechecking for XML transformers
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Operations and language generating devices suggested by the genome evolution
Theoretical Computer Science
Parallel communicating grammar systems with bounded resources
Theoretical Computer Science
Error-detecting properties of languages
Theoretical Computer Science
Uni-transitional Watson-Crick DOL systems
Theoretical Computer Science
Even linear simple matrix languages: formal language properties and grammatical inference
Theoretical Computer Science
DNA Complementarity and Paradigms of Computing
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
The Root of a Language and Its Complexity
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Some Petri Net Languages and Codes
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
Characterization results for time-varying codes
Fundamenta Informaticae
Formal and natural computing
Finite codes over free binoids
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Descriptional complexity of scattered rewriting and multirewriting: an overview
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Bounds for the D0L language equivalence problem
Information and Computation
Representing recursively enumerable languages by iterated deletion
Theoretical Computer Science
Trajectory-based embedding relations
Fundamenta Informaticae
The language equivalence problem for HD0L systems having D0L growths
Theoretical Computer Science - Insightful theory
Explicit test sets for iterated morphisms in free monoids and metabelian groups
Theoretical Computer Science - Insightful theory
The class of HDTOL sequences is closed with respect to rational functions
Information Processing Letters
Descriptional complexity of error/edit systems
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Connections between subwords and certain matrix mappings
Theoretical Computer Science - The art of theory
On the Test Case Definition for GUI Testing
QSIC '05 Proceedings of the Fifth International Conference on Quality Software
Regular solutions of language inequalities and well quasi-orders
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Generating the Peano curve and counting occurrences of some patterns
Journal of Automata, Languages and Combinatorics
A non-learnable class of E-pattern languages
Theoretical Computer Science - Algorithmic learning theory(ALT 2002)
A Formal Language Analysis of DNA Hairpin Structures
Fundamenta Informaticae
On Some Problems of Mateescu Concerning Subword Occurrences
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
On the Problem Whether the Image of an N-Rational Series Equals
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Mild Context-Sensitivity, After Twenty Years
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Routes and Products of Monoids
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Multiset-Based Self-Assembly of Graphs
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
On String Languages Generated by Spiking Neural P Systems
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Subword Balance in BinaryWords, Languages and Sequences
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Grammar Systems versus Membrane Computing: The Case of CD Grammar Systems
Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS
On Cooperating Distributed Grammar Systems with Competence Based Start and Stop Conditions
Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS
Codes defined by multiple sets of trajectories
Theoretical Computer Science
Partial words and the critical factorization theorem revisited
Theoretical Computer Science
Bad News on Decision Problems for Patterns
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Large Simple Binary Equality Words
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Note: Two undecidable variants of Collatz's problems
Theoretical Computer Science
Scattered subword complexity of non-primitive words
Journal of Automata, Languages and Combinatorics
Automata accepting bifix codes
Journal of Automata, Languages and Combinatorics
Parallel Contextual Hexagonal Array Grammars and Languages
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Computing Maximal Error-detecting Capabilities and Distances of Regular Languages
Fundamenta Informaticae
Equivalence of set- and bag-valued orbits
Journal of Automata, Languages and Combinatorics
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Computationally complete spiking neural P systems without delay: two types of neurons are enough
CMC'10 Proceedings of the 11th international conference on Membrane computing
Interpreting motion events of pairs of moving objects
Geoinformatica
What is a maximal error-detecting capability of a formal language?
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Restricted ambiguity of erasing morphisms
Theoretical Computer Science
The block structure of successor morphisms
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Fast and precise sanitizer analysis with BEK
SEC'11 Proceedings of the 20th USENIX conference on Security
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Splicing systems: accepting versus generating
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
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
Beyond iteration vectors: instancewise relational abstract domains
SAS'06 Proceedings of the 13th international conference on Static Analysis
Hairpin structures in DNA words
DNA'05 Proceedings of the 11th international conference on DNA Computing
Towards practical computable functions on context-free languages
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Iterated TGR languages: membership problem and effective closure properties
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Unambiguous morphic images of strings
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
On hairpin-free words and languages
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Efficient local unfolding with ancestor stacks for full prolog
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
On codes defined by bio-operations
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
A ciliate bio-operation and language families
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
On the equivalence problem for e-pattern languages over small alphabets
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
State complexity of kleene-star operations on trees
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Block Substitutions and Their Properties
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Synchronized Shuffle on Backbones
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Nondeterministic Bimachines and Rational Relations with Finite Codomain
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
On a Connection Between Cooperating Distributed Grammar Systems and Basic Process Algebra
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Injectivity of the Parikh Matrix Mappings Revisited
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
On P Systems and Almost Periodicity
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Contextual Grammars with Subregular Choice
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Trajectory-Based Embedding Relations
Fundamenta Informaticae
Characterization Results for Time-Varying Codes
Fundamenta Informaticae
Extended Watson---Crick L systems with regular trigger languages and restricted derivation modes
Natural Computing: an international journal
Inferring descriptive generalisations of formal languages
Journal of Computer and System Sciences
Computing maximal Kleene closures that are embeddable in a given subword-closed language
Natural Computing: an international journal
On computational complexity of graph inference from counting
Natural Computing: an international journal
Left Random Context ET0L Grammars
Fundamenta Informaticae
| Hi-index | 0.01 |