A complexity theory based on Boolean algebra
Journal of the ACM (JACM)
Early error detection in syntax-driven parsers
IBM Journal of Research and Development
A practical arbitrary look-ahead LR parsing technique
SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
ACM SIGART Bulletin
ACM SIGSMALL/PC Notes
Decidability and expressiveness aspects of logic queries
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A rule-based circuit representation for automated CMOS design and verification
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Church-Rosser Thue systems and formal languages
Journal of the ACM (JACM)
Grammatical abstraction and incremental syntax analysis in a language-based editor
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Two-level grammars as a technique for formalizing programming schemes
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Cecil: A Sequencing Constraint Language for Automatic Static Analysis Generation
IEEE Transactions on Software Engineering
A formal model for context-free languages augmented with reduplication
Computational Linguistics
On Kilbury's modification of Earley's algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computation of Probabilities for an Island-Driven Parser
IEEE Transactions on Pattern Analysis and Machine Intelligence
Four Dimensions of programming-language independence
ACM SIGPLAN Notices
A restated pumping lemma for context-free languages
ACM SIGACT News
Learning two-tape automata from queries and counterexamples
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Decidability of bisimulation equivalence for process generating context-free languages
Journal of the ACM (JACM)
RE2C: a more versatile scanner generator
ACM Letters on Programming Languages and Systems (LOPLAS)
On the power of bounded concurrency II: pushdown automata
Journal of the ACM (JACM)
Optimal Probabilistic Evaluation Functions for Search Controlled by Stochastic Context-Free Grammars
IEEE Transactions on Pattern Analysis and Machine Intelligence
Verifying infinite state processes with sequential and parallel composition
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Characteristic Sets for Polynomial Grammatical Inference
Machine Learning
Relative liveness and behavior abstraction (extended abstract)
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Counting and random generation of strings in regular languages
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Inference of Reversible Languages
Journal of the ACM (JACM)
On the relationship between LL(1) and LR(1) grammars
Journal of the ACM (JACM)
A Supernormal-Form Theorem for Context-Free Grammars
Journal of the ACM (JACM)
The Complexity of LALR(k) Testing
Journal of the ACM (JACM)
An Iteration Theorem for Simple Precedence Languages
Journal of the ACM (JACM)
Parallel RAMs with owned global memory and deterministic context-free language recognition
Journal of the ACM (JACM)
The expressibility of languages and relations by word equations
Journal of the ACM (JACM)
Undecidability of context-sensitive data-dependence analysis
ACM Transactions on Programming Languages and Systems (TOPLAS)
An Improved Context-Free Recognizer
ACM Transactions on Programming Languages and Systems (TOPLAS)
MAS — an interactive synthesizer to support behavioral modelling in UML
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
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
Fast context-free grammar parsing requires fast boolean matrix multiplication
Journal of the ACM (JACM)
Associative language descriptions
Theoretical Computer Science
L(A)=L(B)? a simplified decidability proof
Theoretical Computer Science
Natural Language Grammatical Inference with Recurrent Neural Networks
IEEE Transactions on Knowledge and Data Engineering
Efficient EREW PRAM Algorithms for Parentheses-Matching
IEEE Transactions on Parallel and Distributed Systems
Testing membership in parenthesis languages
Random Structures & Algorithms
Algebraic aspects of families of fuzzy languages
Theoretical Computer Science - Algebraic methods in language processing
Answering Queries Using Materialized Views with Disjunctions
ICDT '99 Proceedings of the 7th International Conference on Database Theory
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Characterization of Context-Free Languages with Polynomially Bounded Ambiguity
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Computation of the N Best Parse Trees for Weighted and Stochastic Context-Free Grammars
Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
Dynamic Constraints and Object Migration
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Balanced Grammars and Their Languages
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,
Deciding DPDA Equivalence Is Primitive Recursive
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Church-Rosser Languages vs. UCFL
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Some Structural Properties of Associative Language Descriptions
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Prefix Languages of Church-Rosser Languages
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
An Introduction to Decidability of DPDA Equivalence
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Do We Need Liveness? - Approximation of Liveness Properties by Safety Properties
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
On the Parallel Complexity of Tree Automata
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Extended Context-Free Grammars and Normal Form Algorithms
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
A Deterministic Shift-Reduce Parser Generator for a Logic Programming Language
CL '00 Proceedings of the First International Conference on Computational Logic
Valuated and Valence Grammars: An Algebraic View
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Greibach Normal Form in Algebraically Complete Semirings
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
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
Prediction-Preserving Reducibility with Membership Queries on Formal Languages
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Efficient Universal Pushdown Cellular Automata and Their Application to Complexity
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Combining Invertible Example-Based Machine Translation with Translation Memory Technology
AMTA '00 Proceedings of the 4th Conference of the Association for Machine Translation in the Americas on Envisioning Machine Translation in the Information Future
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Lower bounds for dynamic transitive closure, planar point location, and parantheses matching
Nordic Journal of Computing
Balanced grammars and their languages
Formal and natural computing
Polynomial-time identification of very simple grammars from positive data
Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
McNaughton families of languages
Theoretical Computer Science
On the degree of scattered context-sensitivity
Theoretical Computer Science
VLSI architectures for high speed recognition of context-free languages and finite-state languages
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
Equations between regular terms and an application to process logic
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Program transformations and skeletons: formal derivation of parallel programs
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Information Processing Letters
Theoretical Computer Science
Formal grammars for intermolecular structure
INBS '95 Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95)
A recognition and parsing algorithm for arbitrary conjunctive grammars
Theoretical Computer Science
The context-splittable normal form for Church--Rosser language systems
Information and Computation - RTA 2001
Regular binoid expressions and regular binoid languages
Theoretical Computer Science
Inducing grammars from sparse data sets: a survey of algorithms and results
The Journal of Machine Learning Research
On the entropy of regular languages
Theoretical Computer Science - WORDS
Growth-sensitivity of context-free languages
Theoretical Computer Science - WORDS
On the complexity of Simon automata over the Dyck language
Journal of Automata, Languages and Combinatorics
Practical experiments with regular approximation of context-free languages
Computational Linguistics - Special issue on finite-state methods in NLP
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
Left-to-right parsing and bilexical context-free grammars
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Mathematical aspects of command relations
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Natural languages and the Chomsky hierarchy
EACL '85 Proceedings of the second conference on European chapter of the Association for Computational Linguistics
Theoretical Computer Science
Computing the similarity of two sequences with nested arc annotations
Theoretical Computer Science
The semantics of grammar formalisms seen as computer languages
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Finite-state approximation of phrase structure grammars
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Towards history-based grammars: using richer models for probabilistic parsing
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
A symmetrical approach to parsing and generation
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Minimal change and bounded incremental parsing
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
A generalized Greibach Normal Form for definite clause grammars
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Context-Free grammar rewriting and the transfer of packed linguistic representations
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
On the number of nonterminals in linear conjunctive grammars
Theoretical Computer Science
Families of languages defined by ciliate bio-operations
Theoretical Computer Science
The language intersection problem for non-recursive context-free grammars
Information and Computation
Chart-parsing techniques and the prediction of valid editing moves in structured document authoring
Proceedings of the 2004 ACM symposium on Document engineering
Efficient parsing for bilexical context-free grammars and head automaton grammars
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Global Index Grammars and Descriptive Power
Journal of Logic, Language and Information
Polynomial time learning of simple deterministic languages via queries and a representative sample
Theoretical Computer Science
A Coarse-Grained multicomputer algorithm for the detection of repetitions
Information Processing Letters
Probabilistic Finite-State Machines-Part I
IEEE Transactions on Pattern Analysis and Machine Intelligence
Parsing non-recursive context-free grammars
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Encyclopedia of Computer Science
On the applicability of Global Index Grammars
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 2
Towards history-based grammars: using richer models for probabilistic parsing
HLT '91 Proceedings of the workshop on Speech and Natural Language
Weighted rational transductions and their application to human language processing
HLT '94 Proceedings of the workshop on Human Language Technology
The structure of reflexive regular splicing languages via Schützenberger constants
Theoretical Computer Science
Information and Computation
Formal Language Theory for natural language processing
ETMTNLP '02 Proceedings of the ACL-02 Workshop on Effective tools and methodologies for teaching natural language processing and computational linguistics - Volume 1
Theoretical Computer Science - Mathematical foundations of computer science 2004
Fuzzy context-free languages: part 1: Generalized fuzzy context-free grammars
Theoretical Computer Science
Fuzzy context-free languages: part 2: Recognition and parsing algorithms
Theoretical Computer Science
Generating all permutations by context-free grammars in Chomsky normal form
Theoretical Computer Science - Algebraic methods in language processing
Linear splicing and syntactic monoid
Discrete Applied Mathematics
Probabilistic parsing strategies
Journal of the ACM (JACM)
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
On the power of circular splicing
Discrete Applied Mathematics - Special issue: Max-algebra
Prime normal form and equivalence of simple grammars
Theoretical Computer Science - Implementation and application of automata
Probabilistic parsing strategies
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
An alternative method of training probabilistic LR parsers
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
One-Turn Regulated Pushdown Automata and Their Reduction
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
Observation of String-Rewriting Systems
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Parallel communicating Watson-Crick automata systems
Acta Cybernetica
Equivalence of simple functions
Theoretical Computer Science
Context-dependent nondeterminism for pushdown automata
Theoretical Computer Science
A geometric characterization of automatic semigroups
Theoretical Computer Science
Observing locally self-stabilization
Journal of High Speed Networks - Self-Stabilizing Systems, Part 1
Fuzzy Sets and Systems
Fuzzy Sets and Systems
Efficient Revalidation of XML Documents
IEEE Transactions on Knowledge and Data Engineering
On Symbolic Verification of Weakly Extended PAD
Electronic Notes in Theoretical Computer Science (ENTCS)
Lower bound technique for length-reducing automata
Information and Computation
Finite turns and the regular closure of linear context-free languages
Discrete Applied Mathematics
PUMPS Architecture for Pattern Analysis and Image Database Management
IEEE Transactions on Computers
On complexity of grammars related to the safety problem
Theoretical Computer Science
Canonical scattered context generators of sentences with their parses
Theoretical Computer Science
Self-regulating finite automata
Acta Cybernetica
On the computing power of fuzzy Turing machines
Fuzzy Sets and Systems
Learning one-counter languages in polynomial time
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Information and Computation
Information Processing Letters
Fast Stochastic Context-Free Parsing: A Stochastic Version of the Valiant Algorithm
IbPRIA '07 Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I
Deterministic Pushdown Automata and Unary Languages
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
A Taxonomy of Deterministic Forgetting Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Learning Balls of Strings from Edit Corrections
The Journal of Machine Learning Research
Efficient on-line repetition detection
Theoretical Computer Science
Generating all permutations by context-free grammars in Greibach normal form
Theoretical Computer Science
Efficient reconfigurable embedded parsers
Computer Languages, Systems and Structures
The Compositional Method and Regular Reachability
Electronic Notes in Theoretical Computer Science (ENTCS)
Membrane computing with transport and embedded proteins
Theoretical Computer Science
An improved representation for evolving programs
Genetic Programming and Evolvable Machines
On Stateless Deterministic Restarting Automata
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
How to make biological systems compute: simply observe them
Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems
A Decision Procedure for Detecting Atomicity Violations for Communicating Processes with Locks
Proceedings of the 16th International SPIN Workshop on Model Checking Software
Context-free parsing through regular approximation
FSMNLP '09 Proceedings of the International Workshop on Finite State Methods in Natural Language Processing
Regulated nondeterminism in pushdown automata
Theoretical Computer Science
Journal of Artificial Intelligence Research
A logic program schema and its applications
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
A rule-driven dynamic programming decoder for statistical MT
SSST '08 Proceedings of the Second Workshop on Syntax and Structure in Statistical Translation
Maximum likelihood analysis of algorithms and data structures
Theoretical Computer Science
On the power of circular splicing
Discrete Applied Mathematics
Linear splicing and syntactic monoid
Discrete Applied Mathematics
Fragments of Monadic Second-Order Logics Over Word Structures
Electronic Notes in Theoretical Computer Science (ENTCS)
Information and Computation
A Coarse-Grained Multicomputer algorithm for the detection of repetitions
Information Processing Letters
Automatic verification of sequential infinite-state processes
Automatic verification of sequential infinite-state processes
A bibliographical study of grammatical inference
Pattern Recognition
Finite automata and non-self-embedding grammars
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Test sets for large families of languages
DLT'03 Proceedings of the 7th international conference on Developments in language theory
The equivalence problem for t-turn dpda is co-NP
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
LR parsing for global index languages (GILs)
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Descriptional complexity of bounded context-free languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
An alternative algorithm for constraint automata product
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
GIGs: restricted context-sensitive descriptive power in bounded polynomial-time
CICLing'03 Proceedings of the 4th international conference on Computational linguistics and intelligent text processing
Derived types in semantic association discovery
Journal of Intelligent Information Systems
Optimal rank reduction for linear context-free rewriting systems with fan-out two
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Testing square-freeness of strings compressed by balanced straight line program
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
IAAI'92 Proceedings of the fourth conference on Innovative applications of artificial intelligence
Computation of upper-bounds for stochastic context-free languages
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Descriptional complexity of (un)ambiguous finite state machines and pushdown automata
RP'10 Proceedings of the 4th international conference on Reachability problems
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
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
Generating all circular shifts by context-free grammars in Chomsky normal form
Journal of Automata, Languages and Combinatorics
Theoretical and computational properties of transpositions
Natural Computing: an international journal
Precedence automata and languages
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
On restarting automata with window size one
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Unavoidable regularities in long words with bounded number of symbol occurrences
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
On the Mathematical Foundations of Syntactic Structures
Journal of Logic, Language and Information
Binary bubble languages and cool-lex order
Journal of Combinatorial Theory Series A
Quasi-rocking real-time pushdown automata
Theoretical Computer Science
On complexity of grammars related to the safety problem
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
Text mining using markov chains of variable length
Proceedings of the 2005 international conference on Federation over the Web
Reducing simple grammars: exponential against highly-polynomial time in practice
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Leftist grammars and the chomsky hierarchy
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Strict deterministic aspects of minimalist grammars
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Approximating dependency grammars through intersection of regular languages
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Ten open problems in grammatical inference
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
A unified algorithm for extending classes of languages identifiable in the limit from positive data
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Three learnable models for the description of language
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
On the expressive power of FO[+]
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
Primitive words are unavoidable for context-free languages
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Extending stochastic context-free grammars for an application in bioinformatics
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Equivalence of functions represented by simple context-free grammars with output
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Context-Dependent nondeterminism for pushdown automata
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Closure of language classes under bounded duplication
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Algebraic systems and pushdown automata
Algebraic Foundations in Computer Science
XML validation for context-free grammars
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
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
Prime normal form and equivalence of simple grammars
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Classical computability and fuzzy turing machines
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Prefix probabilities for linear context-free rewriting systems
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Splicing systems and the Chomsky hierarchy
Theoretical Computer Science
Groups, graphs, languages, automata, games and second-order monadic logic
European Journal of Combinatorics
Context-free pairs of groups I: Context-free pairs and graphs
European Journal of Combinatorics
A formal specification of document processing
Mathematical and Computer Modelling: An International Journal
Descriptional complexity of two-way pushdown automata with restricted head reversals
Theoretical Computer Science
Growing Grammars and Length-reducing Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Descriptional complexity of pushdown store languages
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Semigroups with a context-free word problem
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
States and heads do count for unary multi-head finite automata
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Hairpin completion with bounded stem-loop
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Observation of String-Rewriting Systems
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
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
One-Turn Regulated Pushdown Automata and Their Reduction
Fundamenta Informaticae
Journal of Computer and System Sciences
Operator precedence and the visibly pushdown property
Journal of Computer and System Sciences
Multi-Bracketed Contextual Rewriting Grammars
Fundamenta Informaticae
Pattern Ambiguities for Pure Context—Free Grammars
Fundamenta Informaticae
On a Hierarchy of Slender Languages Based on Control Sets
Fundamenta Informaticae
A NOTE ON THE GRAMMATICAL INFERENCE PROBLEM FOR EVEN LINEAR LANGUAGES
Fundamenta Informaticae
TOWARDS AN ALGEBRAIC THEORY OF CONTEXT-FREE LANGUAGES
Fundamenta Informaticae
COMPLEXITY AND STRUCTURE IN FORMAL LANGUAGE THEORY
Fundamenta Informaticae
EXPANDING GRAPH RELABELING SYSTEMS HAVE THE POWER OF RECURSIVE ENUMERABILITY
Fundamenta Informaticae
(0,1)-TOTALITY IS UNDECIDABLE FOR ARBITRARY CONTEXT-FREE GRAMMARS
Fundamenta Informaticae
Grammatical Codes Of Trees And Terminally Coded Grammars
Fundamenta Informaticae
A concept of unification of network security policies
Proceedings of the Fifth International Conference on Security of Information and Networks
GESwarm: grammatical evolution for the automatic synthesis of collective behaviors in swarm robotics
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Descriptional complexity of bounded context-free languages
Information and Computation
Expressiveness and static analysis of extended conjunctive regular path queries
Journal of Computer and System Sciences
LALBLC a program testing the equivalence of dpda's
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Some decision problems concerning NPDAs, palindromes, and dyck languages
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Parsing by matrix multiplication generalized to Boolean grammars
Theoretical Computer Science
Unavoidable regularities in long words with bounded number of symbol occurrences
Journal of Combinatorial Optimization
| Hi-index | 0.04 |
From the Publisher:Formal language theory was fist developed in the mid 1950's in an attempt to develop theories of natural language acquisition. It was soon realized that this theory (particularly the context-free portion) was quite relevant to the artificial languages that had originated in computer science. Since those days, the theory of formal languages has been developed extensively, and has several discernible trends, which include applications to the syntactic analysis of programming languages, program schemes, models of biological systems, and relationships with natural languages.