scientific article; zbMATH DE number 3254902

zbMATH Open0158.25401MaRDI QIDQ5541336FDOQ5541336

Authors: Jozef Gruska 

Publication date: 1967

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

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cites Work

• Two Families of Languages Related to ALGOL
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (26)

• Title not available (Why is that?)
• On the cover complexity of finite languages
• Title not available (Why is that?)
• Conditional Lindenmayer systems with conditions defined by bounded resources
• On an extension of the class of context-free languages
• Context-Free Languages of Countable Words
• A characterization of context-free languages
• Title not available (Why is that?)
• Contextual grammars vs. context-free algebras
• Language classes generated by tree controlled grammars with bounded nonterminal complexity
• Language classes generated by tree controlled grammars with bounded nonterminal complexity
• Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet
• Pareto grammars
• Simulating finite automata with context-free grammars.
• Title not available (Why is that?)
• Fast deterministic parsers for transition networks
• Title not available (Why is that?)
• On commutative context-free languages
• Syntactic complexity of context-free grammars over word monoids
• On context-free and Szilard languages
• Descriptional complexity of context-free grammar forms
• Title not available (Why is that?)
• On bounded interpretations of grammar forms
• Concise description of finite languages
• Context free closed families of languages
• Concerning two-adjacent context-free languages

Uses Software

• ALGOL 60

This page was built for publication:

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