scientific article
From MaRDI portal
Publication:4066625
zbMath0308.68058MaRDI QIDQ4066625
Seymour Ginsburg, Sheila A. Greibach
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (37)
The theory of languages ⋮ The complexity of optimizing finite-state transducers ⋮ Quasi-realtime languages ⋮ The theory of languages ⋮ A Note on Decidable Separability by Piecewise Testable Languages ⋮ Reset machines ⋮ The equivalence of stack-counter acceptors and quasi-realtime stack- counter acceptors ⋮ Controlled pushdown automata ⋮ MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS ⋮ Automates a file ⋮ Some language families generated by one-letter languages ⋮ Abstract families of relations ⋮ One counter languages and the IRS condition ⋮ Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems ⋮ Abstract families of length-preserving processors ⋮ Abstract families of relations ⋮ Uniformly erasable AFL ⋮ Bounded AFLs ⋮ Proving containment of bounded AFL ⋮ Some uniformly erasable families of languages ⋮ Finite automata with multiplication ⋮ Single-valued a-transducers ⋮ On languages specified by relative acceptance ⋮ Checking automata and one-way stack languages ⋮ Scattered context grammars ⋮ Properties of syntax directed translations ⋮ Derivation-bounded languages ⋮ The decidability of equivalence for deterministic finite transducers ⋮ Writing pushdown acceptors ⋮ Syntactic operators on full semiAFLs ⋮ A hierarchy between context-free and context-sensitive languages ⋮ Principal abstract families of weighted tree languages ⋮ Three theorems concerning principal AFLs ⋮ Time-bounded grammars and their languages ⋮ On AFL generators for finitely encoded AFA ⋮ Extended macro grammars and stack controlled machines ⋮ A note on undecidable properties of formal languages
This page was built for publication:
