Bounded Algol-Like Languages

Cited in

(only showing first 100 items - show all)

Finite automata with multiplication
String and graph grammar characterizations of bounded regular languages
Single-tape reset machines
Synchronization of Parikh automata
Jumping automata over infinite words
Properties of right one-way jumping finite automata
A note on Parikh maps, abstract languages, and decision problems
Sur les ensembles linéaires
Descriptional complexity of bounded context-free languages
Extended automata-like regular expressions of star degree at most (2,1)
Complementation of Branching Automata for Scattered and Countable N-Free Posets
The decidability of a mapping problem for generalized sequential machines with final states
Extended regular expressions of star degree at most two
Non axiomatisability of positive relation algebras with constants, via graph homomorphisms
Ambiguity and decision problems for local adjunct languages
mathlib4 Module Mathlib/ModelTheory/Arithmetic/Presburger/Semilinear/Basic
mathlib4 Module Mathlib/ModelTheory/Arithmetic/Presburger/Semilinear/Defs
scientific article; zbMATH DE number 3578341 (Why is no real title available?)
State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs
Expressiveness and static analysis of extended conjunctive regular path queries
On the equivalence and containment problems for context-free languages
Proving containment of bounded AFL
History-deterministic Parikh automata
A characterization of semilinear sets
AFL with the semilinear property
Mutually divisible semigroups
The geometry of reachability in continuous vector addition systems with states
Bounded context switching for valence systems
Synchronized CTL over one-counter automata
On the expressiveness of Büchi arithmetic
A complete refinement procedure for regular separability of context-free languages
On the equivalence and containment problems for context-free languages
Porous invariants
Bounded languages described by GF(2)-grammars
The complexity of the satisfiability problem for Krom formulas
Counter machines and verification problems.
Counting productions in context-free derivations
Observations about bounded languages and developmental systems
Counter machines and counter languages
Learning pomset automata
The semilinear home-space problem is Ackermann-complete for Petri nets
Verifying unboundedness via amalgamation
Some decision problems concerning sequential transducers and checking automata
Kernels of sub-classes of context-free languages
Eliminating the storage tape in reachability constructions.
Learning semilinear sets from examples and via queries
Separability of rational relations in A^* N^m by recognizable relations is decidable
Non-closure under complementation for unambiguous linear grammars
scientific article; zbMATH DE number 7471708 (Why is no real title available?)
The synthesis of Petri nets from path-automatic specifications
scientific article; zbMATH DE number 7559138 (Why is no real title available?)
Forward analysis and model checking for trace bounded WSTS
A theorem on generalizations of proofs
Kernels of context-free languages
A note on undecidable properties of formal languages
The commutative closure of a binary slip-language is context-free: A new proof.
On the unavoidability of primitive words and other languages
On lengths of words in context-free languages
A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems
Verification in loosely synchronous queue-connected discrete timed automata.
Multitape NFA: Weak Synchronization of the Input Heads
Rational relations having a rational trace on each finite intersection of rational relations
Unboundedness problems for machines with reversal-bounded counters
2DST mappings of languages and related problems
The ring of k-regular sequences
Parikh's theorem and descriptional complexity
Forward analysis and model checking for trace bounded WSTS
An infinite hierarchy of intersections of context-free languages
On the Petri net realization of context-free graphs
scientific article; zbMATH DE number 3551930 (Why is no real title available?)
Substitution and bounded languages
Effective equation solving, constraints, and growth in virtually abelian groups
Bounded underapproximations
Control sets on grammars
Recognition of poly-slender context-free languages by trellis automata
The theory of languages
Recursive generation of local adjunct languages
Bounded AFLs
On the language of primitive words
Computational complexity of synchronization under sparse regular constraints
The equivalence problem for deterministic MSO tree transducers is decidable
The theory of languages
Transductions des langages de Chomsky
Enumerating projections of integer points in unbounded polyhedra
Operational state complexity and decidability of jumping finite automata
Syntactic operators on full semiAFLs
The big-O problem
A characterization of poly-slender context-free languages
On the home-space problem for Petri nets and its Ackermannian complexity
On regular trace languages
Techniques for showing the decidability of the boundedness problem of language acceptors
On the growth of linear languages
Sparse and slender subsets of monoids.
The growth function of context-free languages
The big-O problem for labelled Markov chains and weighted automata
A note on some languages in uniform \(ACC^ 0\)
On the sum of chemical reactions
A note on semilinear sets and bounded-reversal multihead pushdown automata
Commutative Lambek grammars
On the power of ordering in linear arithmetic theories

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)