The theory of languages
From MaRDI portal
Publication:5551468
DOI10.1007/BF01692510zbMath0165.32001OpenAlexW1989581197MaRDI QIDQ5551468
Publication date: 1968
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01692510
Related Items (14)
Efficient symbolic analysis of programs ⋮ Computing the relative entropy between regular tree languages ⋮ Prolog infinite trees and automata ⋮ Stochastic grammars and languages ⋮ Interdependent translation schemes ⋮ A note on weak operator precedence grammars ⋮ Solvability of equivalence problem for program machines ⋮ Spectrum of prime \(L\)-fuzzy \(h\)-ideals of a hemiring. ⋮ On inverse deterministic pushdown transductions ⋮ The nonexistence of some covering context-free grammars ⋮ Improvement of the LR parsing table and its application to grammatical error correction ⋮ Transducers and repetitions ⋮ Theory of formal grammars ⋮ A formal methodology using attributed grammars for multiprocessing-system software development. II. Validation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Real time computation
- Nonerasing stack automata
- On certain formal properties of grammars
- Note on the boolean properties of context free languages
- Multi-tape and infinite-state automata—a survey
- On the Computational Complexity of Algorithms
- The Syntax of Programming Languages-A Survey
- Some Recursively Unsolvable Problems in ALGOL-Like Languages
- Inherent ambiguity of minimal linear grammars
- A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
- Summary of the Issue
- Ambiguity in context free languages
- Bounded Algol-Like Languages
- Preservation of unambiguity and inherent ambiguity in context-free languages
- Deterministic context free languages
- Mappings which preserve context sensitive languages
- Finite-Turn Pushdown Automata
- Quotients of Context-Free Languages
- The Unsolvability of the Recognition of Linear Context-Free Languages
- Two-Tape Simulation of Multitape Turing Machines
- Matrix Equations and Normal Forms for Context-Free Grammars
- Recognition and parsing of context-free languages in time n3
- The Independence of Inherent Ambiguity From Complementedness Among Context-Free Languages
- Three models for the description of language
- Decidable and Undecidable Questions About Automata
- An Approach to a Unified Theory of Automata
- Two-way pushdown automata
- Parenthesis Grammars
- Relations Between Time and Tape Complexities
- One-way stack automata
- Sets accepted by one-way stack automata are context sensitive
- Operations Which Preserve Definability in Languages
- Two Families of Languages Related to ALGOL
- Classes of languages and linear-bounded automata
- On the translation of languages from left to right
- On The Ambiguity Problem of Backus Systems
- The undecidability of the ambiguity problem for minimal linear grammars
- Three theorems on phrase structure grammars of type 1
- Finite counting automata
- On Computable Numbers, with an Application to the Entscheidungsproblem
- A variant of a recursively unsolvable problem
This page was built for publication: The theory of languages
