Abstract interaction tools: a language for user interface management systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Church-Rosser Thue systems and formal languages
Journal of the ACM (JACM)
Practical parsing of generalized phrase structure grammars
Computational Linguistics
Some Relations Among Stochastic Finite State Networks Used in Automatic Speech Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Datalog expressiveness of chain queries: grammar tools and characterizations
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Decidability of bisimulation equivalence for process generating context-free languages
Journal of the ACM (JACM)
The representation of recursive languages and its impact on the efficiency of learning
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Optimization of functional programs by grammar thinning
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the Parsing of Deterministic Languages
Journal of the ACM (JACM)
On Equivalence and Containment Problems for Formal Languages
Journal of the ACM (JACM)
Stack Machines and Classes of Nonnested Macro Languages
Journal of the ACM (JACM)
Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
Journal of the ACM (JACM)
The Sequence Equivalence Problem is Decidable for 0S Systems
Journal of the ACM (JACM)
A Morphic Representation of Complements of Recursively Enumerable Sets
Journal of the ACM (JACM)
A Generalization of Ogden's Lemma
Journal of the ACM (JACM)
Specification and dialogue control of visual interaction through visual rewriting systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
String operations in query languages
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Theoretical Computer Science
Several remarks on computations of labelled Markov algorithms
ACM-SE 20 Proceedings of the 20th annual Southeast regional conference
Normal form algorithms for extended context-free grammars
Theoretical Computer Science
Forty years of formal power series in automata theory
A half-century of automata theory
Gene assembly in ciliates: computing by folding and recombination
A half-century of automata theory
Local constraints in the syntax and semantics of programming languages
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Binary (generalized) post correspondence problem
Theoretical Computer Science
Parallel communicating grammar systems with bounded resources
Theoretical Computer Science
Sequential grammars and automata with valances
Theoretical Computer Science
Uni-transitional Watson-Crick DOL systems
Theoretical Computer Science
SAICSIT '02 Proceedings of the 2002 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology
Factorizations of languages and commutativity conditions
Acta Cybernetica
Open Systems and Consciousness. A Physical Discussion
Open Systems & Information Dynamics
Simple Strategies to Encode Tree Automata in Sigmoid Recursive Neural Networks
IEEE Transactions on Knowledge and Data Engineering
Journal of Automata, Languages and Combinatorics
Topics in the theory of DNA computing
Theoretical Computer Science - Natural computing
Theoretical Computer Science - Natural computing
GP Systems with forbidding context
Fundamenta Informaticae - Membrane computing
Closure properties of multiset language families
Fundamenta Informaticae - Membrane computing
Algebraic aspects of families of fuzzy languages
Theoretical Computer Science - Algebraic methods in language processing
On Emergence in Evolutionary Multiagent Systems
ECAL '01 Proceedings of the 6th European Conference on Advances in Artificial Life
Variations on a Theorem of Fine & Wilf
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Characterizing Simpler Recognizable Sets of Integers
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
DNA Complementarity and Paradigms of Computing
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Extended Context-Free Grammars and Normal Form Algorithms
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Multiset and K -Subset Transforming Systems
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Shuffle Quotient and Decompositions
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Strong Iteration Lemmata for Regular, Linear, Context-Free, and Linear Indexed Languages
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Grammar Systems as Language Analyzers and Recursively Enumerable Languages
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Periodicity, morphisms, and matrices
Theoretical Computer Science - Mathematical foundations of computer science
Formal and natural computing
On the sentence valuation in a semiring
Information Sciences—Informatics and Computer Science: An International Journal
Toward a formalization of emergence
Artificial Life
APL '84 Proceedings of the international conference on APL
On decomposing languages defined by parallel devices
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
A partial solution to the reachability-problem for vector-addition systems
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
A language for two-dimensional digital picture processing
The papers of the ACM symposium on Graphic languages
Developmental systems and languages
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Consistency and correctness of duplicate database systems
SOSP '77 Proceedings of the sixth ACM symposium on Operating systems principles
The influence of productions on derivations and parsing (Extended Abstract)
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
The splicing as an operation on formal languages
INBS '95 Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95)
INBS '95 Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95)
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Definable relations and first-order query languages over strings
Journal of the ACM (JACM)
Journal of Automata, Languages and Combinatorics
There are no iterated morphisms that define the Arshon sequence and the σ-sequence
Journal of Automata, Languages and Combinatorics
Remarks on simple eco-grammar systems with prescribed teams
Journal of Automata, Languages and Combinatorics
Natural Computing: an international journal
Closure and decidability properties of some language classes with respect to ciliate bio-operations
Theoretical Computer Science
Function-dependent teams in eco-grammar systems
Theoretical Computer Science
Theoretical Computer Science
The ld and dlad bio-operations on formal languages
Journal of Automata, Languages and Combinatorics
On regular drawn symbolic picture languages
Information and Computation
Efficient text fingerprinting via Parikh mapping
Journal of Discrete Algorithms
Theoretical Computer Science
Contextual grammars as generative models of natural languages
Computational Linguistics
Coping with syntactic ambiguity or how to put the block in the box on the table
Computational Linguistics
Subword histories and Parikh matrices
Journal of Computer and System Sciences
Natural languages and the Chomsky hierarchy
EACL '85 Proceedings of the second conference on European chapter of the Association for Computational Linguistics
Context-freeness of the power of context-free languages is undecidable
Theoretical Computer Science
Unification phonology: another look at "synthesis-by-rule"
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Results on catalytic and evolution-communication P systems
New Generation Computing - Membrane computing
Language equations, maximality and error-detection
Journal of Computer and System Sciences
Pattern expressions and pattern automata
Information Processing Letters
Template-guided DNA recombination
Theoretical Computer Science - Descriptional complexity of formal systems
On the descriptional complexity of some rewriting mechanisms regulated by context conditions
Theoretical Computer Science - Descriptional complexity of formal systems
Theoretical Computer Science - Insightful theory
Equality sets of prefix morphisms and regular star languages
Information Processing Letters
Encyclopedia of Computer Science
A remark on evolutionary systems
Discrete Applied Mathematics
On properties of bond-free DNA languages
Theoretical Computer Science
Rewriting P systems: improved hierarchies
Theoretical Computer Science
Adding symbolic information to picture models: definitions and properties
Theoretical Computer Science
The relation of Lorenzen calculus to formal language theory
ACM SIGSAM Bulletin
Simulating tree growth based on internal and environmental factors
GRAPHITE '05 Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia
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
Some new aspects of word-length controlled DT0L systems
Journal of Automata, Languages and Combinatorics
Periodic and Sturmian languages
Information Processing Letters
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
On the power of parallel communicating Watson-Crick automata systems
Theoretical Computer Science
New Generation Computing
Incremental construction of minimal deterministic finite cover automata
Theoretical Computer Science - Implementation and application of automata
Restarting automata with restricted utilization of auxiliary symbols
Theoretical Computer Science - Implementation and application of automata
Information Sciences: an International Journal
Prelanguages Versus Submonoids
Fundamenta Informaticae
On Equations Including Strings
Fundamenta Informaticae
Languages generated by iterated idempotency
Theoretical Computer Science
Universality results for P systems based on brane calculi operations
Theoretical Computer Science
New Iteration Lemmata for Regular Languages
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Undecidability in ω-Regular Languages
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
Injectivity of the Parikh Matrix Mappings Revisited
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Observation of String-Rewriting Systems
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
On String Languages Generated by Spiking Neural P Systems
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Z. Pawlak, a Precursor of DNA Computing and of Picture Grammars
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Self-assembly of strings and languages
Theoretical Computer Science
A note on ambiguity of internal contextual grammars
Theoretical Computer Science
Fuzzy Sets and Systems
Membrane Systems with Marked Membranes
Electronic Notes in Theoretical Computer Science (ENTCS)
Membrane Systems with Peripheral Proteins: Transport and Evolution
Electronic Notes in Theoretical Computer Science (ENTCS)
Finite turns and the regular closure of linear context-free languages
Discrete Applied Mathematics
Regulated RNA rewriting: Modelling RNA editing with guided insertion
Theoretical Computer Science
An infinite hierarchy induced by depth synchronization
Theoretical Computer Science
Canonical scattered context generators of sentences with their parses
Theoretical Computer Science
Cellular Automata and Parallel Array Systems
Fundamenta Informaticae - Special issue on DLT'04
A Formal Model of Multi-Agent Organisations
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Spiking neural P systems with extended rules: universality and languages
Natural Computing: an international journal
International Journal of Computer Mathematics - Celebrating the Life of David J. Evans
Decision problems in membrane systems with peripheral proteins, transport and evolution
Theoretical Computer Science
Membrane systems with proteins embedded in membranes
Theoretical Computer Science
On the Computational Power of Flip-Flop Proteins on Membranes
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
On the Computational Power of Enhanced Mobile Membranes
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Hopcroft's Minimization Technique: Queues or Stacks?
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Deterministic Input-Reversal and Input-Revolving Finite Automata
Language and Automata Theory and Applications
The Expressiveness of Concentration Controlled P Systems
UC '08 Proceedings of the 7th international conference on Unconventional Computing
Experiments on the reliability of stochastic spiking neural P systems
Natural Computing: an international journal
Note: On the descriptional complexity of scattered context grammars
Theoretical Computer Science
Several aspects of context freeness for hyperedge replacement grammars
WSEAS Transactions on Computers
On Descriptional Complexity of Partially Parallel Grammars
Fundamenta Informaticae
Membrane computing with transport and embedded proteins
Theoretical Computer Science
DNA splicing: computing by observing
Natural Computing: an international journal
About normal forms for hyperedge replacement grammars
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
A transformational language for mutant description
Computer Languages, Systems and Structures
Theoretical Computer Science
Undecidability of Operation Problems for T0L Languages and Subclasses
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
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
Array P Systems and t.Communication
Fundamenta Informaticae - Machines, Computations and Universality, Part I
On the expressiveness and complexity of randomization in finite state monitors
Journal of the ACM (JACM)
Hyperedge replacement languages and pushdown automata
MACMESE'08 Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering
On the size of computationally complete hybrid networks of evolutionary processors
Theoretical Computer Science
On the synchronized derivation depth of context-free grammars
Theoretical Computer Science
Permutation Languages in Formal Linguistics
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
Recombination Patterns for Natural Syntax
IWINAC '09 Proceedings of the 3rd International Work-Conference on The Interplay Between Natural and Artificial Computation: Part I: Methods and Models in Artificial and Natural Computation. A Homage to Professor Mira's Scientific Legacy
A powerful abelian square-free substitution over 4 letters
Theoretical Computer Science
Power of Randomization in Automata on Infinite Strings
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Turing Completeness Using Three Mobile Membranes
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
Descriptional Complexity of Tissue-Like P Systems with Cell Division
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
On the Relative Expressive Power of Contextual Grammars with Maximal and Depth-First Derivations
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Pure 2D picture grammars and languages
Discrete Applied Mathematics
Regulated nondeterminism in pushdown automata
Theoretical Computer Science
A logic program schema and its applications
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
A framework for control in production systems
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 1
Inductive inference of context-free languages: context-free expression method
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 1
On input-revolving deterministic and nondeterministic finite automata
Information and Computation
Grammar characterization of flowgraphs
IBM Journal of Research and Development
On the context-free production complexity of finite languages
Discrete Applied Mathematics
Notes: A remark on evolutionary systems
Discrete Applied Mathematics
Fuzzy regular languages over finite and infinite words
Fuzzy Sets and Systems
The nonexistence of some covering context-free grammars
Information Processing Letters
Equality sets of prefix morphisms and regular star languages
Information Processing Letters
Pattern expressions and pattern automata
Information Processing Letters
Periodic and Sturmian languages
Information Processing Letters
Some properties of ciliate bio-operations
DLT'02 Proceedings of the 6th international conference on Developments in language theory
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
Feedback-free circuits in the algebra of transients
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Computation with absolutely no space overhead
DLT'03 Proceedings of the 7th international conference on Developments in language theory
On pure multi-pushdown automata that perform complete pushdown pops
Acta Cybernetica
Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
Theoretical Computer Science
Regulated nondeterminism in pushdown automata
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
P systems and picture languages
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Pure 2D picture grammars (P2DPG) and P2DPG with regular control
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Bounded Number of Parallel Productions in Scattered Context Grammars with Three Nonterminals
Fundamenta Informaticae
Computational power of two stacks with restricted communication
Information and Computation
Scattered context grammars generate any recursively enumerable language with two nonterminals
Information Processing Letters
About digital images and Lindenmayer systems
MAMECTIS'10 Proceedings of the 12th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems
Left-forbidding cooperating distributed grammar systems
Theoretical Computer Science
Simple restriction in context-free rewriting
Journal of Computer and System Sciences
On erasing productions in random context grammars
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Complexity in union-free regular languages
DLT'10 Proceedings of the 14th international conference on Developments in language theory
DNA computing: a research snapshot
Algorithms and theory of computation handbook
Learning subclasses of parallel communicating grammar systems
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Languages generated by context-free grammars extended by type AB → BA rules
Journal of Automata, Languages and Combinatorics
Multi-limited simple eco-grammar systems with prescribed teams
Journal of Automata, Languages and Combinatorics
Computing by observing: Simple systems and simple observers
Theoretical Computer Science
5′ → 3′ Watson-Crick Automata With Several Runs
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Regulated Nondeterminism in Pushdown Automata: The Non-Regular Case
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Theoretical Computer Science
Block insertion and deletion on trajectories
Theoretical Computer Science
Decidability of operation problems for T0L languages and subclasses
Information and Computation
Information and Computation
Probabilistic Büchi automata with non-extremal acceptance thresholds
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Matrix insertion-deletion systems for bio-molecular structures
ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
Stochastic grammars for intelligent software systems modeling
MMACTEE'06 Proceedings of the 8th WSEAS international conference on Mathematical methods and computational techniques in electrical engineering
Parsing CFGs and PCFGs with a Chomsky-Schützenberger representation
LTC'09 Proceedings of the 4th conference on Human language technology: challenges for computer science and linguistics
Limited simple eco-grammar systems with prescribed teams
Journal of Automata, Languages and Combinatorics
Communication membrane systems with active symports
Journal of Automata, Languages and Combinatorics
Event-related outputs of computations in P systems
Journal of Automata, Languages and Combinatorics
A unifying Kleene theorem for weighted finite automata
Rainbow of computer science
Rainbow of computer science
Mutual mobile membranes with objects on surface
Natural Computing: an international journal
Theoretical and computational properties of transpositions
Natural Computing: an international journal
Binary images, M-vectors, and ambiguity
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Workspace theorems for regular-controlled grammars
Theoretical Computer Science
CD grammar systems: competence and confidence
Computation, cooperation, and life
Generative power of eco-colonies
Computation, cooperation, and life
On some biologically motivated control devices for parallel rewriting
Computation, cooperation, and life
Precedence automata and languages
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
About graph and hypergraph context free grammars
Proceedings of the 15th WSEAS international conference on Computers
Gaining power by input operations: finite automata and beyond
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
On the complexity of szilard languages of regulated grammars
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
A note on algebras of languages
Theoretical Computer Science
Computability power of mobility in enhanced mobile membranes
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Quasi-rocking real-time pushdown automata
Theoretical Computer Science
Membrane systems with external control
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Graphical modeling of higher plants using p systems
WMC'06 Proceedings of the 7th international conference on Membrane Computing
DNA'05 Proceedings of the 11th international conference on DNA Computing
On computational properties of template-guided DNA recombination
DNA'05 Proceedings of the 11th international conference on DNA Computing
Replicative - distribution rules in p systems with active membranes
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Artificial life for natural language processing
ECAL'05 Proceedings of the 8th European conference on Advances in Artificial Life
IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
Boolean circuits and a DNA algorithm in membrane computing
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Computing with spiking neural p systems: traces and small universal systems
DNA'06 Proceedings of the 12th international conference on DNA Computing
On descriptive complexity of p systems
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Finite sets of words and computing
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Some non-semi-decidability problems for linear and deterministic context-free languages
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Viral gene compression: complexity and verification
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
The boolean closure of linear context-free languages
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Automatic checking of component protocols in component-based systems
SC'06 Proceedings of the 5th international conference on Software Composition
Operator precedence and the visibly pushdown property
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Closure of language classes under bounded duplication
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
End-Marked maximal depth-first contextual grammars
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
State-Identification problems for finite-state transducers
FATES'06/RV'06 Proceedings of the First combined international conference on Formal Approaches to Software Testing and Runtime Verification
An incremental algorithm for constructing minimal deterministic finite cover automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Restricting the use of auxiliary symbols for restarting automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
The dilemma of covert channels searching
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
An infinite hierarchy of languages defined by dP systems
Theoretical Computer Science
A P system model with pure context-free rules for picture array generation
Mathematical and Computer Modelling: An International Journal
Fundamenta Informaticae
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Array P Systems and t.Communication
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Generalized derivations with synchronized context-free grammars
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Non-erasing variants of the Chomsky---Schützenberger theorem
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Computational Efficiency of Intermolecular Gene Assembly
Fundamenta Informaticae
On Descriptional Complexity of Partially Parallel Grammars
Fundamenta Informaticae
Z. Pawlak, a Precursor of DNA Computing and of Picture Grammars
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
Cellular Automata and Parallel Array Systems
Fundamenta Informaticae - Special issue on DLT'04
A Formal Model of Multi-Agent Organisations
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Undecidability in ω-Regular Languages
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
Injectivity of the Parikh Matrix Mappings Revisited
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Observation of String-Rewriting Systems
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
On the properties of language classes defined by bounded reaction automata
Theoretical Computer Science
Theoretical Computer Science
New Iteration Lemmata for Regular Languages
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
GP Systems with Forbidding Context
Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)
Closure Properties of Multiset Language Families
Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)
On Equations Including Strings
Fundamenta Informaticae
Journal of Computer and System Sciences
Operator precedence and the visibly pushdown property
Journal of Computer and System Sciences
Prelanguages Versus Submonoids
Fundamenta Informaticae
Multi-Bracketed Contextual Rewriting Grammars
Fundamenta Informaticae
On Accepting Pure Lindenmayer Systems
Fundamenta Informaticae
Parallelism in Contextual Grammars
Fundamenta Informaticae
Fundamenta Informaticae
Algebraic, Linear and Rational Languages Defined by Mix Operation
Fundamenta Informaticae
Remarks on Operations Suggested by Mutations in Genomes
Fundamenta Informaticae
Fundamenta Informaticae
On The Computational Complexity of Marcus Contextual Languages
Fundamenta Informaticae
Pattern Ambiguities for Pure Context—Free Grammars
Fundamenta Informaticae
ON GRAMMAR AND LANGUAGE FAMILIES
Fundamenta Informaticae
TOWARDS AN ALGEBRAIC THEORY OF CONTEXT-FREE LANGUAGES
Fundamenta Informaticae
TEXT LANGUAGES IN AN ALGEBRAIC FRAMEWORK
Fundamenta Informaticae
CONTEXTUAL GRAMMARS: PARALLELISM AND BLOCKING OF DERIVATION
Fundamenta Informaticae
SOME UNDECIDABILITY RESULTS CONCERNING k-LIMITED 0L SYSTEMS
Fundamenta Informaticae
GRAPH GRAMMARS WITH NEGATIVE APPLICATION CONDITIONS
Fundamenta Informaticae
Parallel communicating grammar systems with negotiation
Fundamenta Informaticae
On The Generative Capacity Of Certain Classes Of Cooperating Grammar Systems
Fundamenta Informaticae
Grammatical Codes Of Trees And Terminally Coded Grammars
Fundamenta Informaticae
Fundamenta Informaticae
Top-down deterministic parsing of languages generated by CD grammar systems
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Maximal and minimal scattered context rewriting
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology
Computing through gene assembly
UC'07 Proceedings of the 6th international conference on Unconventional Computation
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
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 the power of permitting features in cooperating context-free array grammar systems
Discrete Applied Mathematics
Flexible RNA design under structure and sequence constraints using formal languages
Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
Left Random Context ET0L Grammars
Fundamenta Informaticae
The Complexity of Szilard Languages of Matrix Grammars Revisited
Fundamenta Informaticae
Bridging Membrane and Reaction Systems --Further Results and Research Topics
Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
| Hi-index | 0.04 |