Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity

Recommendations

On bounded semilinear languages, counter machines, and finite-index ET0L
The effect of end-markers on counter machines and commutativity
On counting functions of languages
On counting functions and slenderness of languages
CHARACTERIZATIONS OF BOUNDED SEMILINEAR LANGUAGES BY ONE-WAY AND TWO-WAY DETERMINISTIC MACHINES

Cites work

Analytic models and ambiguity of context-free languages
CHARACTERIZATIONS OF BOUNDED SEMILINEAR LANGUAGES BY ONE-WAY AND TWO-WAY DETERMINISTIC MACHINES
Checking automata and one-way stack languages
Context-free grammar forms
Deux Familles de Langages Incomparables
Elements of automata theory. Translated from the French by Reuben Thomas
Finite-Turn Pushdown Automata
scientific article; zbMATH DE number 3821114 (Why is no real title available?)
scientific article; zbMATH DE number 3978429 (Why is no real title available?)
scientific article; zbMATH DE number 3655375 (Why is no real title available?)
scientific article; zbMATH DE number 3657147 (Why is no real title available?)
scientific article; zbMATH DE number 3497806 (Why is no real title available?)
scientific article; zbMATH DE number 3509706 (Why is no real title available?)
scientific article; zbMATH DE number 3569855 (Why is no real title available?)
scientific article; zbMATH DE number 3588051 (Why is no real title available?)
scientific article; zbMATH DE number 3639163 (Why is no real title available?)
scientific article; zbMATH DE number 3251418 (Why is no real title available?)
scientific article; zbMATH DE number 3293666 (Why is no real title available?)
Inherent ambiguity of minimal linear grammars
Linear indexed languages
MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
On ambiguity in EOL systems
On Context-Free Languages
On counting functions and slenderness of languages
On ETOL systems of finite index
On families of full trios containing counter machine languages
On inherently ambiguous E0L languages
On the commutative equivalence of bounded context-free and regular languages: the code case
On the commutative equivalence of bounded context-free and regular languages: the semi-linear case
On the commutative equivalence of semi-linear sets of \(\mathbb{N}^k\)
On the effect of the finite index restriction on several families of grammars
On the family of finite index matrix languages
On the generating sequences of regular languages on \(k\) symbols
On the structure of the counting function of sparse context-free languages.
Rational sets in commutative monoids
Remarks on blind and partially blind one-way multicounter machines
Reversal-Bounded Multicounter Machines and Their Decision Problems
Reversal-bounded multipushdown machines
Some decision problems concerning semilinearity and commutation.
The characterization of nonexpansive grammars by rational power series
The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index
The effect of end-markers on counter machines and commutativity

Cited in

(6)

On Families of Full Trios Containing Counter Machine Languages
On bounded semilinear languages, counter machines, and finite-index ET0L
On the commutative equivalence of bounded context-free and regular languages: the code case
Unboundedness problems for machines with reversal-bounded counters
On the Commutative Equivalence of Algebraic Formal Series and Languages
On the containment problem for deterministic multicounter machine models

This page was built for publication: Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity

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