scientific article; zbMATH DE number 3293675
From MaRDI portal
Publication:5576262
zbMath0184.28703MaRDI QIDQ5576262
Publication date: 1969
Full work available at URL: https://eudml.org/doc/27292
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (17)
Networks of evolutionary processors: the power of subregular filters ⋮ Aspects of Reversibility for Classical Automata ⋮ Expressive Capacity of Concatenation Freeness ⋮ Unnamed Item ⋮ Simple splicing systems ⋮ Merging two hierarchies of external contextual grammars with subregular selection ⋮ Relations of contextual grammars with strictly locally testable selection languages ⋮ Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars ⋮ Unnamed Item ⋮ Generative Capacity of Contextual Grammars with Subregular Selection Languages* ⋮ Accepting networks of evolutionary processors with subregular filters ⋮ Finite automata with undirected state graphs ⋮ Determination of finite automata accepting subregular languages ⋮ Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity ⋮ Unnamed Item ⋮ Accepting networks of evolutionary processors with resources restricted and structure limited filters ⋮ Concatenation-free languages
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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a class of regular sets
- On some properties of the free monoids with applications to automata theory
- Transition graphs and the star-height of regular events
- Dot-depth of star-free events
- General properties of star height of regular events
- Sur l'Utilisation des Integrales de Contour dans les Problemes de Stocks et de Delais d'Attente
- The Allocation of Aircraft to Routes—An Example of Linear Programming Under Uncertain Demand
- Simultaneous Processing of Jobs on an Electronic Computer
- Realization of Events by Logical Nets
- Method for Solving the Korteweg-deVries Equation
- Numerical solution of initial boundary value problems involving maxwell's equations in isotropic media
- Irreversibility and Heat Generation in the Computing Process
- Decision Problems of Finite Automata Design and Related Arithmetics
- Regularity preserving modifications of regular expressions
- On the Construction of Sequential Machines from Regular Expressions
- Ultimate-Definite and Symmetric-Definite Events and Automata
- Lattice-Ordered Semigroups, Graphs, and Automata
- A Survey of Regular Expressions and Their Applications
- Über Die Darstellbarkeit Von Ereignissen in Nicht‐Initialen Automaten
- On finite monoids having only trivial subgroups
- Über die Konstruktion endlicher Automaten
- Author's reply
- Bounded Regular Sets
- Quotients of Context-Free Languages
- The theory of sequential relations
- Two Complete Axiom Systems for the Algebra of Regular Events
- On Concatenative Decompositions of Regular Events
- A Procedure for Checking Equality of Regular Expressions
- Lower Bound of the Number of Threshold Functions
- Generalized finite automata theory with an application to a decision problem of second-order logic
- The Theory of Definite Automata
- Roots of Star Events
- Stochastische Ereignisse und Wortmengen
- Polylinear Sequential Circuit Realizations of Finite Automata
- Programming Techniques: Regular expression search algorithm
- The loop complexity of pure-group events
- Design of Sequential Machines from Their Regular Expressions
- Two Complete Axiom Systems for the Extended Language of Regular Expressions
- Serial-to-Parallel Transformation of Linear-Feedback Shift-Register Circuits
- Canonical representations of chain events
- A Diagrammatic Approach to Multilevel Logic Synthesis
- On a question of Eggan
- Testing and generating infinite sequences by a finite automaton
- Derivatives of Regular Expressions
- Generalizations of regular events
- Finite counting automata
- Boolean Matrices and the Stability of Neural Nets
This page was built for publication:
