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