On finite-index indexed grammars and their restrictions (Q2042723): Difference between revisions

Latest revision as of 06:44, 26 July 2024

scientific article; zbMATH DE number 6725144

On Finite-Index Indexed Grammars and Their Restrictions

Language	Label	Description	Also known as
English	On finite-index indexed grammars and their restrictions	scientific article; zbMATH DE number 6725144	On Finite-Index Indexed Grammars and Their Restrictions

Statements

instance of

scholarly article

0 references

title

On finite-index indexed grammars and their restrictions (English)

0 references

On Finite-Index Indexed Grammars and Their Restrictions (English)

0 references

zbMATH Open document ID

1497.68242

0 references

1485.68127

0 references

DOI

10.1016/j.ic.2020.104613

0 references

10.1007/978-3-319-53733-7_21

0 references

0 references

0 references

0 references

Information and Computation

0 references

Language and Automata Theory and Applications

0 references

publication date

21 July 2021

0 references

1 June 2017

0 references

full work available at URL

https://arxiv.org/abs/1610.06366

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

indexed languages

0 references

finite-index

0 references

full trios

0 references

semi-linearity

0 references

bounded languages

0 references

ET0L languages

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

0 references

Indexed Grammars—An Extension of Context-Free Grammars

0 references

Nested Stack Automata

0 references

Q3859267

0 references

Linear indexed languages

0 references

Q5576254

0 references

Q3862379

0 references

Reversal-Bounded Multicounter Machines and Their Decision Problems

0 references

On Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0L

0 references

On Families of Full Trios Containing Counter Machine Languages

0 references

Q4746787

0 references

On ETOL systems of finite index

0 references

On the effect of the finite index restriction on several families of grammars

0 references

The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index

0 references

The equivalence of four extensions of context-free grammars

0 references

An Approach to Computing Downward Closures

0 references

Reversal-bounded multipushdown machines

0 references

On the complexity and decidability of some problems involving shuffle

0 references

Q4198075

0 references

A Generalization of Linear Indexed Grammars Equivalent to Simple Context-Free Tree Grammars

0 references

Q4140407

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2042723

@@ Property / cites work @@
+Indexed Grammars—An Extension of Context-Free Grammars
+Normal rank
@@ Property / cites work @@
+Nested Stack Automata
@@ Property / cites work: Nested Stack Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Q3859267
@@ Property / cites work: Q3859267 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear indexed languages
@@ Property / cites work: Linear indexed languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q5576254
@@ Property / cites work: Q5576254 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+Reversal-Bounded Multicounter Machines and Their Decision Problems
+Normal rank
@@ Property / cites work @@
+On Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0L
+Normal rank
@@ Property / cites work @@
+On Families of Full Trios Containing Counter Machine Languages
+Normal rank
@@ Property / cites work @@
+Q4746787
@@ Property / cites work: Q4746787 / rank @@
+Normal rank
@@ Property / cites work @@
+On ETOL systems of finite index
@@ Property / cites work: On ETOL systems of finite index / rank @@
+Normal rank
@@ Property / cites work @@
+On the effect of the finite index restriction on several families of grammars
+Normal rank
@@ Property / cites work @@
+The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index
+Normal rank
@@ Property / cites work @@
+The equivalence of four extensions of context-free grammars
+Normal rank
@@ Property / cites work @@
+An Approach to Computing Downward Closures
@@ Property / cites work: An Approach to Computing Downward Closures / rank @@
+Normal rank
@@ Property / cites work @@
+Reversal-bounded multipushdown machines
@@ Property / cites work: Reversal-bounded multipushdown machines / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity and decidability of some problems involving shuffle
+Normal rank
@@ Property / cites work @@
+Q4198075
@@ Property / cites work: Q4198075 / rank @@
+Normal rank
@@ Property / cites work @@
+A Generalization of Linear Indexed Grammars Equivalent to Simple Context-Free Tree Grammars
+Normal rank
@@ Property / cites work @@
+Q4140407
@@ Property / cites work: Q4140407 / rank @@
+Normal rank