Tuple sequences and lexicographic indexes
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
A grammar-based approach towards unifying hierarchical data models
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
The conjecture of Fliess on commutative context-free languages
Journal of the ACM (JACM)
Structural properties of hypertext
Proceedings of the ninth ACM conference on Hypertext and hypermedia : links, objects, time and space---structure in hypermedia systems: links, objects, time and space---structure in hypermedia systems
Storing semistructured data with STORED
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
On Memory Requirements for Context-Free Language Recognition
Journal of the ACM (JACM)
A Remark on Acceptable Sets of Numbers
Journal of the ACM (JACM)
Computational Complexity of One-Tape Turing Machine Computations
Journal of the ACM (JACM)
The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
Journal of the ACM (JACM)
One-way nondeterministic real-time list-storage languages
Journal of the ACM (JACM)
A Universal Syntax-Directed Top-Down Analyzer
Journal of the ACM (JACM)
Indexed Grammars—An Extension of Context-Free Grammars
Journal of the ACM (JACM)
An Infinite Hierarchy of Context-Free Languages
Journal of the ACM (JACM)
Programmed Grammars and Classes of Formal Languages
Journal of the ACM (JACM)
A Direct Proof of the Inherent Ambiguity of a Simple Context-Free Language
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A Syntax-Analysis Procedure for Unambiguous Context-Free Grammars
Journal of the ACM (JACM)
General Problems of Formal Grammars
Journal of the ACM (JACM)
A Grammatical Characterization of One-Way Nondeterministic Stack Languages
Journal of the ACM (JACM)
Addressless Units for Carrying Out Loop-Free Computations
Journal of the ACM (JACM)
On the Covering and Reduction Problems for Context-Free Grammars
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A Formalization of Transition Diagram Systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
On the Parsing of Deterministic Languages
Journal of the ACM (JACM)
An Observation on Relative Parsing Time
Journal of the ACM (JACM)
Initial Algebra Semantics and Continuous Algebras
Journal of the ACM (JACM)
On Equivalence and Containment Problems for Formal Languages
Journal of the ACM (JACM)
Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem
Journal of the ACM (JACM)
A linguistic geometry for technology transfer
SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
Data Type Specification: Parameterization and the Power of Specification Techniques
ACM Transactions on Programming Languages and Systems (TOPLAS)
Shuffle languages, Petri nets, and context-sensitive grammars
Communications of the ACM
Communications of the ACM
The equivalence of reducing transition languages and deterministic languages
Communications of the ACM
A note on the complement of inherently ambiguous context-free languages
Communications of the ACM
An algorithm for the construction of bounded-context parsers
Communications of the ACM
Transition network grammars for natural language analysis
Communications of the ACM
Communications of the ACM
Automata, formal languages abstract switching, and computability in a Ph.D. computer science program
Communications of the ACM
Computational linguistics in a Ph.D. computer science program
Communications of the ACM
Complexity of expressions allowing concurrency
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Validating streaming XML documents
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Flow analysis and optimization of LISP-like structures
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Timing Diagrams: Formalization and Algorithmic Verification
Journal of Logic, Language and Information
Closure properties of multiset language families
Fundamenta Informaticae - Membrane computing
Schemas for Integration and Translation of Structured and Semi-structured Data
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Lambek Grammars Based on Pregroups
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Toward a Formal Macroset Theory
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
Modeling Operating Systems Schedulers with Multi-Stack-Queue Grammars
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
A Parallel Context-Free Derivation Hierarchy
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
Granular computing
Well-abstracted transition systems: application to FIFO automata
Information and Computation
Borel hierarchy and omega context free languages
Theoretical Computer Science
On omega context free languages which are Borel sets of infinite rank
Theoretical Computer Science
Decidability of reachability in vector addition systems (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
The decidability of the reachability problem for vector addition systems (Preliminary Version)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
An algebraic system for process structuring and interprocess communication
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
A useful device for showing the solvability of some decision problems
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
On decomposing languages defined by parallel devices
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Intercalation theorems for tree transducer languages
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Computational parallels between the regular and context-free languages
STOC '74 Proceedings of the sixth 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
How to show something is not: Proofs in formal language and computability theory
SIGCSE '78 Proceedings of the ninth SIGCSE technical symposium on Computer science education
Data type specification: Parameterization and the power of specification techniques
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
On generalized finite automata and unrestricted generative grammars
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
An iteration theorem for one-counter languages.
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Absolutely parallel grammars and two-way deterministic finite-state transducers
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A decision procedure for generalized sequential mapability-onto of regular sets
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Three theorems on abstract families of languages
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Quasi-realtime languages (Extended Abstract)
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
The inherent ambiguity partial algorithm problem for context free languages
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Abstract families of deterministic languages
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Transformations and translations from the point of view of generalized finite automata theory
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Two results concerning the power of two-way deterministic Pushdown Automata
ACM '73 Proceedings of the ACM annual conference
A syntax directed approach for handling natural language relations
ACM '72 Proceedings of the ACM annual conference - Volume 1
The algebra of derivations and a semithue parser
ACM '69 Proceedings of the 1969 24th national conference
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A course on the Relationship of Formal Language Theory to Automata
SIGCSE '70 Proceedings of the first SIGCSE technical symposium on Education in computer science
On the formulation of normal pushdown acceptors
ACM '68 Proceedings of the 1968 23rd ACM national conference
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
Ambiguity in omega context free languages
Theoretical Computer Science
A course on the relationship of formal language theory to automata
ACM SIGCSE Bulletin
Irredundant Algorithms for Traversing Directed Graphs: The Deterministic Case
Programming and Computing Software
Determinization of finite state weighted tree automata
Journal of Automata, Languages and Combinatorics
Minimal realization in bicategories of automata
Mathematical Structures in Computer Science
Information Processing Letters
On the preservation of context-free languages in a level-based system
COLING '69 Proceedings of the 1969 conference on Computational linguistics
Properties of formal grammars with mixed types of rules and their linguistic relevance
COLING '69 Proceedings of the 1969 conference on Computational linguistics
COLING '69 Proceedings of the 1969 conference on Computational linguistics
Problems of improving the efficiency of parsing systems
COLING '69 Proceedings of the 1969 conference on Computational linguistics
COLING '69 Proceedings of the 1969 conference on Computational linguistics
A finite-state morphological processor for Spanish
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
A class of transformational recognition grammars
COLING '73 Proceedings of the 5th conference on Computational linguistics - Volume 1
Checking potential validity of XML documents
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Bimachines and structurally-reversed automata
Journal of Automata, Languages and Combinatorics
Language recognition by two-way deterministic pushdown automata
Cybernetics and Systems Analysis
Adding symbolic information to picture models: definitions and properties
Theoretical Computer Science
Decidable first-order transition logics for PA-processes
Information and Computation
Decidability of trajectory-based equations
Theoretical Computer Science - Mathematical foundations of computer science 2004
Operations preserving regular languages
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
On the structure of the counting function of sparse context-free languages
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Decidability analysis of self-stabilization for infinite-state systems
Fundamenta Informaticae
Theoretical Computer Science - Foundations of software science and computation structures
Deterministic catalytic systems are not universal
Theoretical Computer Science - Implementation and application of automata
On a Construction of Context-free Grammars
Fundamenta Informaticae
On Equations Including Strings
Fundamenta Informaticae
The equivalence problem for deterministic MSO tree transducers is decidable
Information Processing Letters
Membrane Computing and Economics: Numerical P Systems
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Equivalence of deterministic pushdown automata revisited
Cybernetics and Systems Analysis
Note: On the separability of sparse context-free languages and of bounded rational relations
Theoretical Computer Science
Generation of Right-Linear Grammars from Regular Expressions
IEEE Transactions on Computers
Applying Probability Measures to Abstract Languages
IEEE Transactions on Computers
A Class of Push-Down Acceptors for Adjunct Languages
IEEE Transactions on Computers
Determination of Probabilistic Grammars for Functionally Specified Probability-Measure Languages
IEEE Transactions on Computers
On Semilinear Sets over Commutative Semirings
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Slender Siromoney matrix languages
Information and Computation
Tree Automata for Non-linear Arithmetic
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Extensional Uniformity for Boolean Circuits
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Synchronization functions of synchronized context-free grammars and languages
Journal of Automata, Languages and Combinatorics
A system for designing fast programming language translators
AFIPS '69 (Spring) Proceedings of the May 14-16, 1969, spring joint computer conference
An extended BNF for specifying the syntax of declarations
AFIPS '69 (Spring) Proceedings of the May 14-16, 1969, spring joint computer conference
Theory of computing in computer science education
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Regulated nondeterminism in pushdown automata
Theoretical Computer Science
The Parikh counting functions of sparse context-free languages are quasi-polynomials
Theoretical Computer Science
On the growth of context-free languages
Journal of Automata, Languages and Combinatorics
Transformational-generative grammar for description of formal properties
Fuzzy Sets and Systems
Decidable first-order transition logics for PA-processes
Information and Computation
LR-regular grammars-an extension of LR(k) grammars
Journal of Computer and System Sciences
Two iteration theorems for some families of languages
Journal of Computer and System Sciences
Left-derivation bounded languages
Journal of Computer and System Sciences
Ambiguity and decision problems for local adjunct languages
Journal of Computer and System Sciences
Structure des grammaires d'ambiguïté bornée
Journal of Computer and System Sciences
A geometric hierarchy of languages
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Deterministic multitape automata computations
Journal of Computer and System Sciences
The equivalence of stack-counter acceptors and quasi-realtime stack-counter acceptors
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Properties of syntax directed translations
Journal of Computer and System Sciences
Journal of Computer and System Sciences
The decidability of a mapping problem for generalized sequential machines with final states
Journal of Computer and System Sciences
Classification of noncounting events
Journal of Computer and System Sciences
Journal of Computer and System Sciences
On the completeness of the inductive assertion method
Journal of Computer and System Sciences
Intercalation lemmas for tree transducer languages
Journal of Computer and System Sciences
Three theorems concerning principal AFLs
Journal of Computer and System Sciences
Bracketed context-free languages
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Fuzzy star functions, probabilistic automata, and their approximation by nonprobabilistic automata
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Checking automata and one-way stack languages
Journal of Computer and System Sciences
Every semilinear set is a finite union of disjoint linear sets
Journal of Computer and System Sciences
Some independent families of one-letter languages
Journal of Computer and System Sciences
On the equivalence, containment, and covering problems for the regular and context-free languages
Journal of Computer and System Sciences
Tape-reversal bounded turing machine computations
Journal of Computer and System Sciences
Closures which preserve finiteness in families of languages
Journal of Computer and System Sciences
Towards a theory of data structures
Journal of Computer and System Sciences
On the extension of Gladkij's Theorem and the Hierarchies of languages
Journal of Computer and System Sciences
Proving containment of bounded AFL
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Some properties of the class of L languages with interactions
Journal of Computer and System Sciences
A useful device for showing the solvability of some decision problems
Journal of Computer and System Sciences
Error detection in formal languages
Journal of Computer and System Sciences
Tree acceptors and some of their applications
Journal of Computer and System Sciences
An hierarchy between context-free and context-sensitive languages
Journal of Computer and System Sciences
Les 1-convexes du monoïde commutatif Nn
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Absolutely parallel grammars and two-way finite-state transducers
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Reversal-bounded multipushdown machines
Journal of Computer and System Sciences
Some definitional suggestions for automata theory
Journal of Computer and System Sciences
A characterization of semilinear sets
Journal of Computer and System Sciences
Generalized2 sequential machine maps
Journal of Computer and System Sciences
AFL with the semilinear property
Journal of Computer and System Sciences
Time-bounded grammars and their languages
Journal of Computer and System Sciences
Syntactic operators on full semiAFLs
Journal of Computer and System Sciences
On the structure of graphic DLI-sets
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Satisfiability with exponential families
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Distributional learning of some context-free languages with a minimally adequate teacher
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Complexity of multi-head finite automata: Origins and directions
Theoretical Computer Science
Block insertion and deletion on trajectories
Theoretical Computer Science
Extensional Uniformity for Boolean Circuits
SIAM Journal on Computing
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
On lifecycle constraints of artifact-centric workflows
WS-FM'10 Proceedings of the 7th international conference on Web services and formal methods
Recognizing shuffled languages
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
There does not exist a minimal full trio with respect to bounded context-free languages
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Descriptional complexity of two-way pushdown automata with restricted head reversals
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Grammar semantics, analysis and parsing by abstract interpretation
Theoretical Computer Science
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Quasi-polynomials, linear Diophantine equations and semi-linear sets
Theoretical Computer Science
On symport/antiport p systems and semilinear sets
WMC'05 Proceedings of the 6th international conference on Membrane Computing
The equivalence problem for deterministic MSO tree transducers is decidable
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Some computational issues in membrane computing
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
The boolean closure of linear context-free languages
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
On the power of anonymous one-way communication
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
On the expressive power of FO[+]
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
On deterministic catalytic systems
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Formal Methods in System Design
An approach to software system behavior description
Computer Languages
High-level debugging of distributed systems: The behavioral abstraction approach
Journal of Systems and Software
Descriptional complexity of two-way pushdown automata with restricted head reversals
Theoretical Computer Science
A Perfect Model for Bounded Verification
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
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
On a hierarchy of languages with catenation and shuffle
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
On Semilinear Sets over Commutative Semirings
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Decidability Analysis of Self-Stabilization for Infinite-State Systems
Fundamenta Informaticae
Membrane Computing and Economics: Numerical P Systems
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Closure Properties of Multiset Language Families
Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)
On Equations Including Strings
Fundamenta Informaticae
On a Construction of Context-free Grammars
Fundamenta Informaticae
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes
Fundamenta Informaticae
UNDECIDABILITY OF LANGUAGE EQUIVALENCE FOR GENERALIZED REGULAR EXPRESSIONS
Fundamenta Informaticae
On One-Rule Grid Semi-Thue Systems
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
The dissecting power of regular languages
Information Processing Letters
Underapproximation of procedure summaries for integer programs
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Descriptional complexity of bounded context-free languages
Information and Computation
On the open problem of Ginsburg concerning semilinear sets and related problems
Theoretical Computer Science
On the Context-Freeness Problem for Vector Addition Systems
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
A Hierarchy of Languages with Catenation and Shuffle
Fundamenta Informaticae - Concurrency, Specification and Programming
| Hi-index | 0.18 |