Bounded Algol-Like Languages

Cited in

(only showing first 100 items - show all)

A note on Parikh maps, abstract languages, and decision problems
On regular trace languages
Hierarchies of one-way multihead automata languages
2DST mappings of languages and related problems
Extended regular expressions of arbitrary star degrees
The ring of k-regular sequences
Learning semilinear sets from examples and via queries
A note on semilinear sets and bounded-reversal multihead pushdown automata
The decidability of a mapping problem for generalized sequential machines with final states
Transductions des langages de Chomsky
Bounded AFLs
A useful device for showing the solvability of some decision problems
Proving containment of bounded AFL
Finite automata with multiplication
Counting productions in context-free derivations
Some decision problems concerning sequential transducers and checking automata
On the language of primitive words
Verification in loosely synchronous queue-connected discrete timed automata.
The commutative closure of a binary slip-language is context-free: A new proof.
On lengths of words in context-free languages
Context-free languages of sub-exponential growth
Ambiguity and decision problems for local adjunct languages
Mutually divisible semigroups
Counter machines and verification problems.
Eliminating the storage tape in reachability constructions.
The synthesis of Petri nets from path-automatic specifications
Computational complexity of synchronization under sparse regular constraints
On the expressiveness of Büchi arithmetic
Learning pomset automata
Characterization and complexity results on jumping finite automata
Recognition of poly-slender context-free languages by trellis automata
Sparse and slender subsets of monoids.
Rational sets in commutative monoids
A characterization of semilinear sets
Substitution and bounded languages
AFL with the semilinear property
A note on some languages in uniform \(ACC^ 0\)
A theorem on generalizations of proofs
A complete refinement procedure for regular separability of context-free languages
Multitape NFA: Weak Synchronization of the Input Heads
Parikh's theorem and descriptional complexity
Forward analysis and model checking for trace bounded WSTS
Forward analysis and model checking for trace bounded WSTS
Sur quelques classes d’applications de N² dans les ensembles finis
Kernels of sub-classes of context-free languages
Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time
Single-tape reset machines
Sur les ensembles linéaires
Descriptional complexity of bounded context-free languages
Expressiveness and static analysis of extended conjunctive regular path queries
Recursive generation of local adjunct languages
scientific article; zbMATH DE number 3551930 (Why is no real title available?)
Observations about bounded languages and developmental systems
scientific article; zbMATH DE number 3578341 (Why is no real title available?)
scientific article; zbMATH DE number 3578342 (Why is no real title available?)
String and graph grammar characterizations of bounded regular languages
A characterization of poly-slender context-free languages
Bounded underapproximations
Enumerating projections of integer points in unbounded polyhedra
Complementation of Branching Automata for Scattered and Countable N-Free Posets
The binomial equivalence classes of finite words
Unboundedness problems for languages of vector addition systems
Bounded context switching for valence systems
On the descriptional complexity of operations on semilinear sets
scientific article; zbMATH DE number 7471708 (Why is no real title available?)
On the unavoidability of primitive words and other languages
The big-O problem for labelled Markov chains and weighted automata
Non axiomatisability of positive relation algebras with constants, via graph homomorphisms
Visibly pushdown languages over sliding windows
The big-O problem
Operational state complexity and decidability of jumping finite automata
A note on undecidable properties of formal languages
Control sets on grammars
The theory of languages
Counter machines and counter languages
On the equivalence and containment problems for context-free languages
On the equivalence and containment problems for context-free languages
scientific article; zbMATH DE number 3293667 (Why is no real title available?)
The theory of languages
An infinite hierarchy of intersections of context-free languages
Decidability of right one-way jumping finite automata
Properties of right one-way jumping finite automata
The growth function of context-free languages
On Parikh slender context-free languages
On the Petri net realization of context-free graphs
A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems
Non-closure under complementation for unambiguous linear grammars
Synchronization of Parikh automata
State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs
Unboundedness problems for machines with reversal-bounded counters
Reversing Unbounded Petri Nets
Commutative Lambek grammars
On the sum of chemical reactions
Porous invariants for linear systems
Geometric decision procedures and the VC dimension of linear arithmetic theories
Jumping automata over infinite words
mathlib4 Module Mathlib/ModelTheory/Arithmetic/Presburger/Semilinear/Basic
mathlib4 Module Mathlib/ModelTheory/Arithmetic/Presburger/Semilinear/Defs
On the power of ordering in linear arithmetic theories
Decidable (ac)counting with Parikh and Muller: adding Presburger arithmetic to monadic second-order logic over tree-interpretable structures

This page was built for publication: Bounded Algol-Like Languages

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