scientific article; zbMATH DE number 3293666
From MaRDI portal
Publication:5576254
zbMath0184.28401MaRDI QIDQ5576254
Publication date: 1966
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
On the Chomsky and Stanley's homomorphic characterization of context-free languages ⋮ Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages ⋮ Graph theoretic closure properties of the family of boundary NLC graph languages ⋮ On solving star equations ⋮ Generating languages by a derivation procedure for elementary formal systems ⋮ Rational equivalence relations ⋮ On commutative context-free languages ⋮ Regulated nondeterminism in pushdown automata ⋮ The equivalence problem for deterministic MSO tree transducers is decidable ⋮ Bounded D0L languages ⋮ Hierarchies of one-way multihead automata languages ⋮ Representation and uniformization of algebraic transductions ⋮ Theory of traces ⋮ Deterministic catalytic systems are not universal ⋮ A unified framework for disambiguating finite transductions ⋮ Boundedness testing for unambiguous context-free grammars ⋮ Finite generation of ambiguity in context-free languages ⋮ Sur les générateurs algébriques et linéaires ⋮ A transformation system for generating description languages of chain code pictures ⋮ Descriptional complexity of bounded context-free languages ⋮ Shuffle on trajectories: Syntactic constraints ⋮ Comparisons of Parikh's condition to other conditions for context-free languages ⋮ Shuffled languages -- representation and recognition ⋮ Cônes rationnels commutatifs ⋮ On the open problem of Ginsburg concerning semilinear sets and related problems ⋮ Complexity of multi-head finite automata: origins and directions ⋮ A representation of trees by languages. II ⋮ Rational bijection of rational sets ⋮ Un théorème de factorisation des produits d'endomorphismes de \(K^N\) ⋮ Deadlock and fairness in parallel schemas: A set-theoretic characterization and decision problems ⋮ On generators and generative capacity of EOL forms ⋮ On bounded languages and reversal-bounded automata ⋮ Eine neue Invariante für kontextfreie Sprachen ⋮ Block insertion and deletion on trajectories ⋮ Selective substitution array grammars ⋮ On the reachability problem for 5-dimensional vector addition systems ⋮ Propositional dynamic logic is weaker without tests ⋮ A note on a problem in the theory of grammatical complexity ⋮ Descriptional complexity of two-way pushdown automata with restricted head reversals ⋮ Position-restricted grammar forms and grammars ⋮ Bounded underapproximations ⋮ A pushdown automaton or a context-free grammar - which is more economical? ⋮ Transformational-generative grammar for description of formal properties ⋮ Extended regular expressions of star degree at most two ⋮ The (generalized) Post correspondence problem with lists consisting of two words is decidable ⋮ Langages satures et cônes decroissants. Langages et cônes bifideles ⋮ Growth properties of power-free languages ⋮ Grammar semantics, analysis and parsing by abstract interpretation ⋮ The Boolean closure of linear context-free languages ⋮ On the commutative equivalence of bounded context-free and regular languages: the code case ⋮ On the commutative equivalence of semi-linear sets of \(\mathbb{N}^k\) ⋮ Fine covers of a VAS language ⋮ Multipass automata and group word problems ⋮ Dynamical properties of PWD0L systems ⋮ A decision method for Parikh slenderness of context-free languages ⋮ Slender Siromoney matrix languages ⋮ Extended regular expressions of arbitrary star degrees ⋮ The context-freeness of the languages associated with vector addition systems is decidable ⋮ Recognising \(k\)-connected hypergraphs in cubic time ⋮ Decision problems and regular chain code picture languages ⋮ An algebraic semantics for structured transition systems and its application to logic programs ⋮ Learning semilinear sets from examples and via queries ⋮ Context-free grammars, differential operators and formal power series ⋮ On bounded rational trace languages ⋮ On 3-head versus 2-head finite automata ⋮ A note on semilinear sets and bounded-reversal multihead pushdown automata ⋮ A geometric hierarchy of languages ⋮ Two iteration theorems for some families of languages ⋮ A decidability theorem for a class of vector-addition systems ⋮ Two-way A-transducers and AFL ⋮ The decidability of a mapping problem for generalized sequential machines with final states ⋮ Progress in free associative algebras ⋮ L-fuzzy grammars ⋮ Natural state transformations ⋮ Some independent families of one-letter languages ⋮ On the unambiguity of n-tuple languages ⋮ Adding symbolic information to picture models: definitions and properties ⋮ First-order logics: some characterizations and closure properties ⋮ Decision problems of object histories ⋮ HDTOL matching of computations of multitape automata ⋮ On the separability of sparse context-free languages and of bounded rational relations ⋮ An undecidable problem about rational sets and contour words of polyominoes ⋮ Effective entropies and data compression ⋮ Intersections de langages algébriques bornes ⋮ Some classes of languages in \(NC^ 1\) ⋮ Syntactic operators on full semiAFLs ⋮ Deciding the inequivalence of context-free grammars with 1-letter terminal alphapet is \(\sum ^ p_ 2\)-complete ⋮ Tetris and decidability ⋮ Quasi-polynomials, linear Diophantine equations and semi-linear sets ⋮ The Parikh counting functions of sparse context-free languages are quasi-polynomials ⋮ Additive structure of totally positive quadratic integers ⋮ Modelling economic processes by means of formal grammars: A survey of results at the middle of 1981 ⋮ Bicentres de langages algébriques ⋮ Iterators for sequence expressions ⋮ Complexity and decidability for chain code picture languages ⋮ A homomorphic characterization of recursively enumerable languages ⋮ Extended automata-like regular expressions of star degree at most (2,1) ⋮ On bounded interpretations of grammar forms ⋮ Order dependency in the relational model ⋮ On the growth of linear languages
This page was built for publication:
