On Context-Free Languages

Cited in

(only showing first 100 items - show all)

Symmetries and the complexity of pure Nash equilibrium
A note on Parikh maps, abstract languages, and decision problems
Higher-level synchronising devices in Meije-SCCS
On commutative context-free languages
Comparisons of Parikh's condition to other conditions for context-free languages
Langages sur des alphabets infinis
On ambiguity in EOL systems
Persistence of vector replacement systems is decidable
Permutations are not context-free: An application of the interchange lemma
Two-way deterministic multi-weak-counter machines
A counting algorithm for a cyclic binary query
Algebraic structure of some stochastic discrete event systems, with applications
A note on semilinear sets and bounded-reversal multihead pushdown automata
Some properties of the class of \(L\) languages with interactions
Tree adjunct grammars
A note on transition systems
A useful device for showing the solvability of some decision problems
Proving containment of bounded AFL
Commutative grammars
Computation sequence sets
A strong pumping lemma for context-free languages
Decidable problems on the strong connectivity of Petri net reachability sets
A simplified proof of Parikh's theorem
One way finite visit automata
On two-way sequential transductions of full semi-AFL's
Counting productions in context-free derivations
Some decision problems concerning sequential transducers and checking automata
Remarks about commutative context-free languages
Iterative reading of numbers and ``black-holes
On the language of primitive words
On vector languages
Automatic verification of recursive procedures with one integer parameter.
A new algorithm for regularizing one-letter context-free grammars.
Modelization of deterministic rational relations
Elementary matrix equivalence and core transformation graphs for Parikh matrices
A theoretical framework for cardinality-based feature models: the semantics and computational aspects
Document spanners: from expressive power to decision problems
Order of weak \(M\)-relation and Parikh matrices
On the teaching complexity of linear sets
On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices
Balancedness of MSO transductions in polynomial time
Model checking for fragments of Halpern and Shoham's interval temporal logic based on track representatives
Abstract interpretation of mobile systems
Grammatical characterizations of NPDAs and VPDAs with counters
Membership problems for regular and context-free trace languages
Efficient text fingerprinting via Parikh mapping
Ambiguity and decision problems for local adjunct languages
Counter machines and verification problems.
Some decision problems concerning semilinearity and commutation.
Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds.
Subword histories and Parikh matrices
Catalytic P systems, semilinear sets, and vector addition systems
Parikh's theorem: a simple and direct automaton construction
The computational power of population protocols
Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity
More on quantum, stochastic, and pseudo stochastic languages with few states
What's decidable about weighted automata?
The commutative closure of shuffle languages over group languages is regular
Visit-bounded stack automata
A toolkit for Parikh matrices
Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy
Parikh word representability of bipartite permutation graphs
\(M\)-ambiguity sequences for Parikh matrices and their periodicity revisited
Reachability relations of timed pushdown automata
Learning pomset automata
On expressive power of regular realizability problems
Enhancement of automata with jumping modes
Parikh matrices for powers of words
Quantitative static analysis of communication protocols using abstract Markov chains
Core words and Parikh matrices
Binary image reconstruction based on prescribed numerical information
Characterization and complexity results on jumping finite automata
Alternating two-way AC-tree automata
Computation in networks of passively mobile finite-state sensors
A new algorithm for testing if a regular language is locally threshold testable
On fairness of D0L systems
Information rate of some classes of non-regular languages: an automata-theoretic approach
Locating maximal approximate runs in a string
Some results on Parikh word representable graphs and partitions
Commutation-augmented pregroup grammars and mildly context-sensitive languages
Parikh matrices and amiable words
Connections between subwords and certain matrix mappings
Independence of certain quantities indicating subword occurrences
Properties of syntax directed translations
A hierarchy between context-free and context-sensitive languages
A characterization of semilinear sets
AFL with the semilinear property
A generalization of Parikh's semilinear theorem
Sublogarithmic ambiguity
Decidable first-order transition logics for PA-processes
Structural properties of word representable graphs
A note on some languages in uniform \(ACC^ 0\)
Approximate consistency for transformations on words and trees
The effect of end-markers on counter machines and commutativity
On a conjecture about Parikh matrices
\( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata
On computational complexity of graph inference from counting
A survey on decidable equivalence problems for tree transducers
Separability of M-equivalent words by morphisms
Generative power of matrix insertion-deletion systems with context-free insertion or deletion

This page was built for publication: On Context-Free Languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5534924)