The theory of languages
From MaRDI portal
Cites work
- A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
- A variant of a recursively unsolvable problem
- Ambiguity in context free languages
- An Approach to a Unified Theory of Automata
- Bounded Algol-Like Languages
- Classes of languages and linear-bounded automata
- Decidable and Undecidable Questions About Automata
- Deterministic context free languages
- Finite counting automata
- Finite-Turn Pushdown Automata
- scientific article; zbMATH DE number 3174044 (Why is no real title available?)
- scientific article; zbMATH DE number 3481857 (Why is no real title available?)
- scientific article; zbMATH DE number 3483582 (Why is no real title available?)
- scientific article; zbMATH DE number 3483585 (Why is no real title available?)
- scientific article; zbMATH DE number 3454791 (Why is no real title available?)
- scientific article; zbMATH DE number 3428547 (Why is no real title available?)
- scientific article; zbMATH DE number 3201659 (Why is no real title available?)
- scientific article; zbMATH DE number 3251418 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- scientific article; zbMATH DE number 3261621 (Why is no real title available?)
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- scientific article; zbMATH DE number 3361265 (Why is no real title available?)
- scientific article; zbMATH DE number 3363526 (Why is no real title available?)
- scientific article; zbMATH DE number 3366672 (Why is no real title available?)
- Inherent ambiguity of minimal linear grammars
- Mappings which preserve context sensitive languages
- Matrix Equations and Normal Forms for Context-Free Grammars
- Multi-tape and infinite-state automata—a survey
- Nonerasing stack automata
- Note on the boolean properties of context free languages
- On certain formal properties of grammars
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On The Ambiguity Problem of Backus Systems
- On the Computational Complexity of Algorithms
- On the translation of languages from left to right
- One-way stack automata
- Operations Which Preserve Definability in Languages
- Parenthesis Grammars
- Preservation of unambiguity and inherent ambiguity in context-free languages
- Quotients of Context-Free Languages
- Real time computation
- Recognition and parsing of context-free languages in time n3
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Relations Between Time and Tape Complexities
- Sets accepted by one-way stack automata are context sensitive
- Some Recursively Unsolvable Problems in ALGOL-Like Languages
- Summary of the Issue
- The Independence of Inherent Ambiguity From Complementedness Among Context-Free Languages
- The Syntax of Programming Languages-A Survey
- The undecidability of the ambiguity problem for minimal linear grammars
- The Unsolvability of the Recognition of Linear Context-Free Languages
- Three models for the description of language
- Three theorems on phrase structure grammars of type 1
- Two Families of Languages Related to ALGOL
- Two-Tape Simulation of Multitape Turing Machines
- Two-way pushdown automata
Cited in
(28)- A note on removing loops from table-driven code generators
- An undecidable problem for context-free grammars
- A Yacc extension for LRR grammar parsing
- Computing dominators in parallel
- Dynamic program slicing
- Structure of decoders for multivalued encodings
- Multidimensional \(\sigma\)-automata, \(\pi\)-polynomials and generalised S-matrices
- Algebraic processing of programming languages
- PHRASE parsers from multi-axiom grammars
- Error correction by mutational grammars
- On the decidability of equivalence for deterministic pushdown transducers
- Finite constants: Characterizations of a new decidable set of constants
- A functional LR parser
- The inclusion problem for simple languages
- Profitability computations on program flow graphs
- On the covering problem for left-recursive grammars
- Efficient management of dynamic tables
- Perfect hashing
- Translation of logic programs into functional fixpoint equations
- Tracing where and who provenance in linked data: a calculus
- A generalized mathematical theory of structured programming
- Über einen Automaten mit Pufferspeicherung
- On the uniqueness of the equilibrium state
- A note on some systems of lindenmayer
- Efficient computation of the locally least-cost insertion string for the LR error repair
- Exponential mixing for heterochaos Baker maps and the Dyck system
- On the 'correct prefix property' in precedence parsers
- Erratum to ``On the 'correct prefix property' in precedence parsers
This page was built for publication: The theory of languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5592247)
