scientific article; zbMATH DE number 3254902

zbMath0158.25401MaRDI QIDQ5541336

Jozef Gruska

Publication date: 1967

Full work available at URL: https://eudml.org/doc/28685

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (16)

Conditional Lindenmayer Systems with Conditions Defined by Bounded Resources ⋮ Contextual grammars vs. context-free algebras ⋮ Concise description of finite languages ⋮ Language classes generated by tree controlled grammars with bounded nonterminal complexity ⋮ Descriptional complexity of context-free grammar forms ⋮ Unnamed Item ⋮ Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet ⋮ Fast deterministic parsers for transition networks ⋮ Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity ⋮ Unnamed Item ⋮ Syntactic complexity of context-free grammars over word monoids ⋮ Unnamed Item ⋮ A characterization of context-free languages ⋮ On the cover complexity of finite languages ⋮ Simulating finite automata with context-free grammars. ⋮ On bounded interpretations of grammar forms

Uses Software

• ALGOL 60

Cites Work

• Two Families of Languages Related to ALGOL
• Unnamed Item
• Unnamed Item

This page was built for publication: