PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
On the power of bounded concurrency II: pushdown automata
Journal of the ACM (JACM)
Interprocedural may-alias analysis for pointers: beyond k-limiting
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Semantic models and abstract interpretation techniques for inductive data structures and pointers
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
SIGCSE '90 Proceedings of the twenty-first SIGCSE technical symposium on Computer science education
A Direct Proof of the Inherent Ambiguity of a Simple Context-Free Language
Journal of the ACM (JACM)
A Syntax-Analysis Procedure for Unambiguous Context-Free Grammars
Journal of the ACM (JACM)
A Note on Ambiguity of Context-Free Languages and Presentations of Semilinear Sets
Journal of the ACM (JACM)
Reversal-Bounded Multicounter Machines and Their Decision Problems
Journal of the ACM (JACM)
Properties of Conflict-Free and Persistent Petri Nets
Journal of the ACM (JACM)
Two-Way Counter Machines and Diophantine Equations
Journal of the ACM (JACM)
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communications of the ACM
Modelization of deterministic rational relations
Theoretical Computer Science
On the injectivity of the Parikh matrix mapping
Fundamenta Informaticae
Counter machines and verification Problems
Theoretical Computer Science
Dependency Analysis of Mobile Systems
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
Conter Machines: Decidable Properties and Applications to Verification Problems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Decidable First-Order Transition Logics for PA-Processes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Verification of Embedded Reactive Fiffo Systems
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Abstract Interpretation-Based Static Analysis of Mobile Ambients
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
Decidability and Closure Properties of Equational Tree Languages
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Hyperedge Substitution in Basic Atom-Replacement Languages
ICGT '02 Proceedings of the First International Conference on Graph Transformation
The Equational Theory of Fixed Points with Applications to Generalized Language Theory
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
The Growing Context-Sensitive Languages Are the Acyclic Context-Sensitive Languages
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Automatic verification of recursive procedures with one integer parameter
Theoretical Computer Science - Mathematical foundations of computer science
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
An algorithm for the general Petri net reachability problem
STOC '81 Proceedings of the thirteenth 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
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 new algorithm for regularizing one-letter context-free grammars
Theoretical Computer Science
Efficient text fingerprinting via Parikh mapping
Journal of Discrete Algorithms
Subword histories and Parikh matrices
Journal of Computer and System Sciences
Catalytic P systems, semilinear sets, and vector addition systems
Theoretical Computer Science
Characterizing structural descriptions produced by various grammatical formalisms
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
SRPVS: A New Motif Searching Algorithm for Protein Analysis
CSB '04 Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference
Linear reachability problems and minimal solutions to linear Diophantine equation systems
Theoretical Computer Science - Implementation and application of automata
Connections between subwords and certain matrix mappings
Theoretical Computer Science - The art of theory
Decidable first-order transition logics for PA-processes
Information and Computation
Theoretical Computer Science - Mathematical foundations of computer science 2004
Computation in networks of passively mobile finite-state sensors
Distributed Computing - Special issue: PODC 04
Interprocedural analysis of asynchronous programs
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Independence of certain quantities indicating subword occurrences
Theoretical Computer Science
Subword conditions and subword histories
Information and Computation
On the Injectivity of Parikh Matrix Mappings
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
The equivalence problem for deterministic MSO tree transducers is decidable
Information Processing Letters
On Some Problems of Mateescu Concerning Subword Occurrences
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
Subword Balance in BinaryWords, Languages and Sequences
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Alternating two-way AC-tree automata
Information and Computation
Discrete Applied Mathematics
A new algorithm for testing if a regular language is locally threshold testable
Information Processing Letters
Parikh matrices and amiable words
Theoretical Computer Science
Approximate schemas, source-consistency and query answering
Journal of Intelligent Information Systems
Languages Modulo Normalization
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Combining Equational Tree Automata over AC and ACI Theories
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Tree Automata for Non-linear Arithmetic
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Newton's Method for ω-Continuous Semirings
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Iterative Learning of Simple External Contextual Languages
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Verifying liveness for asynchronous programs
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Symmetries and the complexity of pure Nash equilibrium
Journal of Computer and System Sciences
Equilibria of Graphical Games with Symmetries
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Regular tree languages definable in FO and in FOmod
ACM Transactions on Computational Logic (TOCL)
Invariant Checking for Programs with Procedure Calls
SAS '09 Proceedings of the 16th International Symposium on Static Analysis
DBPL '09 Proceedings of the 12th International Symposium on Database Programming Languages
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Scattered subword complexity of non-primitive words
Journal of Automata, Languages and Combinatorics
Mixing Coverability and Reachability to Analyze VASS with One Zero-Test
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Decidable first-order transition logics for PA-processes
Information and Computation
Information Sciences: an International Journal
Journal of Computer and System Sciences
Properties of syntax directed translations
Journal of Computer and System Sciences
Proving containment of bounded AFL
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
An hierarchy between context-free and context-sensitive languages
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Journal of Computer and System Sciences
A characterization of semilinear sets
Journal of Computer and System Sciences
AFL with the semilinear property
Journal of Computer and System Sciences
Automatic verification of multi-queue discrete timed automata
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Restarting automata and their relations to the Chomsky hierarchy
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Two-way equational tree automata for AC-like theories: decidability and closure properties
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Monadic second-order logics with cardinalities
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Symmetries and the complexity of pure Nash equilibrium
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Efficient computation of throughput values of context-free languages
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Combining theories with shared set operations
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Iterative learning of simple external contextual languages
Theoretical Computer Science
On the computational complexity of dominance links in grammatical formalisms
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Rewriting systems for reachability in vector addition systems with pairs
RP'10 Proceedings of the 4th international conference on Reachability problems
Efficient construction of semilinear representations of languages accepted by unary NFA
RP'10 Proceedings of the 4th international conference on Reachability problems
Semi-linear Parikh images of regular expressions via reduction
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Journal of Automata, Languages and Combinatorics
Languages generated by context-free grammars extended by type AB → BA rules
Journal of Automata, Languages and Combinatorics
Complexity of multi-head finite automata: Origins and directions
Theoretical Computer Science
The tree width of auxiliary storage
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Complexity of pattern-based verification for multithreaded programs
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the satisfiability of two-variable logic over data words
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Equilibria of graphical games with symmetries
Theoretical Computer Science
Block insertion and deletion on trajectories
Theoretical Computer Science
Approximate Satisfiability and Equivalence
SIAM Journal on Computing
Regular geometrical languages and tiling the plane
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Parikh's theorem: A simple and direct automaton construction
Information Processing Letters
The generative capacity of the lambek-grishin calculus: a new lower bound
FG'09 Proceedings of the 14th international conference on Formal grammar
On lifecycle constraints of artifact-centric workflows
WS-FM'10 Proceedings of the 7th international conference on Web services and formal methods
Binary images, M-vectors, and ambiguity
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Orbits of linear maps and regular languages
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
On global types and multi-party sessions
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Model checking recursive programs with numeric data types
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Chrobak normal form revisited, with applications
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Geometrical regular languages and linear diophantine equations
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
On Mildly Context-Sensitive Non-Linear Rewriting
Research on Language and Computation
Quantitatively fair scheduling
Theoretical Computer Science
ICDT'07 Proceedings of the 11th international conference on Database Theory
Languages as hyperplanes: grammatical inference with string kernels
ECML'06 Proceedings of the 17th European conference on Machine Learning
On intersection problems for polynomially generated sets
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Note: Absoluteness of subword inequality is undecidable
Theoretical Computer Science
The language theory of bounded context-switching
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Adding monotonic counters to automata and transition graphs
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
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
Model checking multithreaded programs with asynchronous atomic methods
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
On the complexity of equational horn clauses
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Automata and logics for unranked and unordered trees
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Real-Counter automata and their decision problems
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
The boolean closure of linear context-free languages
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Algorithmic verification of asynchronous programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Journal of Discrete Algorithms
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Large scale inference of deterministic transductions: tenjinno problem 1
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
The implementation of mazurkiewicz traces in POEM
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Geometricity of binary regular languages
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Static safety for an actor dedicated process calculus by abstract interpretation
FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
A survey on picture-walking automata
Algebraic Foundations in Computer Science
Multitape NFA: weak synchronization of the input heads
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Parikh's theorem and descriptional complexity
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Weak synchronization and synchronizability of multitape pushdown automata and turing machines
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Discrete-time temporal reasoning with horn DLRs
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Geometrical regular languages and linear Diophantine equations: The strongly connected case
Theoretical Computer Science
An appreciation of dexter kozen
Logic and Program Semantics
K-Comma Codes and Their Generalizations
Fundamenta Informaticae
Unambiguous constrained automata
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Learning in the limit with lattice-structured hypothesis spaces
Theoretical Computer Science
Some Alternatives to Parikh Matrices Using String Kernels
Fundamenta Informaticae
Subword Balance in BinaryWords, Languages and Sequences
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
On Some Problems of Mateescu Concerning Subword Occurrences
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Injectivity of the Parikh Matrix Mappings Revisited
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
On the Injectivity of Parikh Matrix Mappings
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
On the Injectivity of the Parikh Matrix Mapping
Fundamenta Informaticae
Path algorithms on regular graphs
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Shuffle expressions and words with nested data
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
How to synchronize the heads of a multitape automaton
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
The dissecting power of regular languages
Information Processing Letters
Computational complexity of linear constraints over the integers
Artificial Intelligence
On selective unboundedness of VASS
Journal of Computer and System Sciences
Several extensions of the Parikh matrix L-morphism
Journal of Computer and System Sciences
Similarity in languages and programs
Theoretical Computer Science
Analysis of Recursively Parallel Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the open problem of Ginsburg concerning semilinear sets and related problems
Theoretical Computer Science
On computational complexity of graph inference from counting
Natural Computing: an international journal
On expressive power of regular realizability problems
Problems of Information Transmission
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
Hi-index | 0.04 |
In this report, certain properties of context-free (CF or type 2) grammars are investigated, like that of Chomsky. In particular, questions regarding structure, possible ambiguity and relationship to finite automata are considered. The following results are presented:The language generated by a context-free grammmar is linear in a sense that is defined precisely.The requirement of unambiguity—that every sentence has a unique phrase structure—weakens the grammar in the sense that there exists a CF language that cannot be generated unambiguously by a CF grammar.The result that not every CF language is a finite automaton (FA) language is improved in the following way. There exists a CF language L such that for any L′ ⊆ L, if L′ is FA, an L″ ⊆ L can be found such that L″ is also FA, L′ ⊆ L″ and L″ contains infinitely many sentences not in L′.A type of grammar is defined that is intermediate between type 1 and type 2 grammars. It is shown that this type of grammar is essentially stronger than type 2 grammars and has the advantage over type 1 grammars that the phrase structure of a grammatical sentence is unique, once the derivation is given.