scientific article; zbMATH DE number 3293675
From MaRDI portal
Publication:5576262
Cites work
- scientific article; zbMATH DE number 5991386 (Why is no real title available?)
- scientific article; zbMATH DE number 5071477 (Why is no real title available?)
- scientific article; zbMATH DE number 5345413 (Why is no real title available?)
- scientific article; zbMATH DE number 3467099 (Why is no real title available?)
- scientific article; zbMATH DE number 3495267 (Why is no real title available?)
- scientific article; zbMATH DE number 3206309 (Why is no real title available?)
- scientific article; zbMATH DE number 3251424 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- scientific article; zbMATH DE number 3265751 (Why is no real title available?)
- scientific article; zbMATH DE number 3271521 (Why is no real title available?)
- scientific article; zbMATH DE number 3305059 (Why is no real title available?)
- scientific article; zbMATH DE number 3305060 (Why is no real title available?)
- scientific article; zbMATH DE number 3305067 (Why is no real title available?)
- scientific article; zbMATH DE number 3310090 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- scientific article; zbMATH DE number 3189697 (Why is no real title available?)
- scientific article; zbMATH DE number 3200658 (Why is no real title available?)
- A Diagrammatic Approach to Multilevel Logic Synthesis
- A Procedure for Checking Equality of Regular Expressions
- A Survey of Regular Expressions and Their Applications
- Author's reply
- Boolean Matrices and the Stability of Neural Nets
- Bounded Regular Sets
- Canonical representations of chain events
- Decision Problems of Finite Automata Design and Related Arithmetics
- Derivatives of Regular Expressions
- Design of Sequential Machines from Their Regular Expressions
- Dot-depth of star-free events
- Finite counting automata
- General properties of star height of regular events
- Generalizations of regular events
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Irreversibility and Heat Generation in the Computing Process
- Lattice-Ordered Semigroups, Graphs, and Automata
- Lower Bound of the Number of Threshold Functions
- Method for Solving the Korteweg-deVries Equation
- Methods for solving engineering problems using analog computers. Chapters 9 and 10 contributed by Arnold Levine
- Numerical solution of initial boundary value problems involving maxwell's equations in isotropic media
- On Concatenative Decompositions of Regular Events
- On a class of regular sets
- On a question of Eggan
- On finite monoids having only trivial subgroups
- On some properties of the free monoids with applications to automata theory
- On the Construction of Sequential Machines from Regular Expressions
- On the usage of contour integrals in inventory and queueing problems
- Polylinear Sequential Circuit Realizations of Finite Automata
- Programming Techniques: Regular expression search algorithm
- Quotients of Context-Free Languages
- Realization of Events by Logical Nets
- Regularity preserving modifications of regular expressions
- Roots of Star Events
- Serial-to-Parallel Transformation of Linear-Feedback Shift-Register Circuits
- Simultaneous processing of jobs on an electronic computer
- Stochastische Ereignisse und Wortmengen
- Testing and generating infinite sequences by a finite automaton
- The Theory of Definite Automata
- The allocation of aircraft to routes -- an example of linear programming under uncertain demand
- The loop complexity of pure-group events
- The theory of sequential relations
- Transition graphs and the star-height of regular events
- Two Complete Axiom Systems for the Algebra of Regular Events
- Two Complete Axiom Systems for the Extended Language of Regular Expressions
- Ultimate-Definite and Symmetric-Definite Events and Automata
- Über Die Darstellbarkeit Von Ereignissen in Nicht‐Initialen Automaten
- Über die Konstruktion endlicher Automaten
Cited in
(18)- Remarks on context-free grammars with subregular control languages
- Accepting networks of evolutionary processors with subregular filters
- Relations of contextual grammars with strictly locally testable selection languages
- Determination of finite automata accepting subregular languages
- scientific article; zbMATH DE number 3395763 (Why is no real title available?)
- Finite automata with undirected state graphs
- Networks of evolutionary processors: the power of subregular filters
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity
- Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars
- Merging two hierarchies of external contextual grammars with subregular selection
- On the generative capacity of contextual grammars with strictly locally testable selection languages
- Generative capacity of contextual grammars with subregular selection languages
- Simple splicing systems
- Concatenation-free languages
- Accepting networks of evolutionary processors with resources restricted and structure limited filters
- Expressive capacity of concatenation freeness
- Aspects of reversibility for classical automata
- scientific article; zbMATH DE number 7347652 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5576262)
