Publication:5588675
From MaRDI portal
zbMath0193.32901MaRDI QIDQ5588675
Publication date: 1969
Related Items
A PROPOSED MULTI‐VALUED EXTENSION TO ALGOL 68, Unnamed Item, There is no complete axiom system for shuffle expressions, A Fully Equational Proof of Parikh's Theorem, On Kleene algebras, A CHARACTERIZATION OF THE ARITHMETICAL HIERARCHY BY LANGUAGE EQUATIONS, Minimal cover-automata for finite languages, VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states, On the state complexity of reversals of regular languages, On equations for regular languages, finite automata, and sequential networks, Partial derivatives of regular expressions and finite automaton constructions, Implicit language equations: existence and uniqueness of solutions, Rewriting extended regular expressions, Finite-state \(\omega\)-languages, Probabilistic Turing machines and recursively enumerable Dedekind cuts, Unresolved systems of language equations: expressive power and decision problems, Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note, Algebraic properties of substitution on trajectories, Language equations with complementation: decision problems, Management and analysis of DNA microarray data by using weighted trees, On classes of tractable unrestricted regular expressions, Towards a formal proof system for \(\omega\)-rational expressions, Traces, dependency graphs and DNLC grammars, On morphic generation of regular languages, Generalized language equations with multiple solutions, On a representation of tree automata, On the active and full use of memory in right-boundary grammars and push- down automata, Theory of traces, An unpredictability approach to finite-state randomness, Les éléments p-réguliers dans les dioides, On generalized language equations, Applying modal logic, Prefix codes, trees, and automata, Realizations of fuzzy languages by probabilistic, max-product, and maximin automata, Ambiguity in the developmental systems of Lindenmayer, Context-free grammars with graph-controlled tables, A note on language equations involving morphisms, On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based, On well quasi orders of free monoids, The state complexities of some basic operations on regular languages, Language equations over a one-letter alphabet with union, concatenation and star: A complete solution, Unrestricted complementation in language equations over a one-letter alphabet, VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states, An equational axiomatization for multi-exit iteration, Solving systems of explicit language relations, The multiplicative fragment of the Yanov equational theory, Nondeterministic regular expressions as solutions of equational systems., A new algorithm for regularizing one-letter context-free grammars., Re-describing an algorithm by Hopcroft, Mergible states in large NFA, Aspects of shuffle and deletion on trajectories, m-recognizability of sets closed under certain affine functions, A homomorphic characterization of principal semi AFLs without using intersection with regular sets, On axioms for commutative regular equations without addition., On equations for union-free regular languages, State complexity of combined operations, Strict deterministic grammars, Some concepts for languages more powerful than context-free, SE-SYSTEMS, TIMING MECHANISMS, AND TIME-VARYING CODES, Unnamed Item, Comparison of basic language generating devices (non-deterministic systems), ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION, Finite Automata as Time-Inv Linear Systems Observability, Reachability and More, Unnamed Item, Trace languages defined by regular string languages, A new normal form for the compositions of morphisms and inverse morphisms, The notion of a probabilistic cellular acceptor, Pure grammars and pure languages†, ON STRATEGIES OF CYBERNETIC MODEL‐BUILDING
