scientific article; zbMATH DE number 3293675

zbMATH Open0184.28703MaRDI QIDQ5576262FDOQ5576262

Authors: Ivan Havel 

Publication date: 1969

Full work available at URL: https://eudml.org/doc/27292

Title of this publication is not available (Why is that?)

zbMATH Keywords

languages, automata, networks

Cites Work

• Method for Solving the Korteweg-deVries Equation
• Title not available (Why is that?)
• Derivatives of Regular Expressions
• Irreversibility and Heat Generation in the Computing Process
• Numerical solution of initial boundary value problems involving maxwell's equations in isotropic media
• Two Complete Axiom Systems for the Algebra of Regular Events
• Title not available (Why is that?)
• Title not available (Why is that?)
• On finite monoids having only trivial subgroups
• Decision Problems of Finite Automata Design and Related Arithmetics
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Title not available (Why is that?)
• Dot-depth of star-free events
• Methods for solving engineering problems using analog computers. Chapters 9 and 10 contributed by Arnold Levine
• Testing and generating infinite sequences by a finite automaton
• Transition graphs and the star-height of regular events
• The allocation of aircraft to routes -- an example of linear programming under uncertain demand
• Quotients of Context-Free Languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bounded Regular Sets
• Programming Techniques: Regular expression search algorithm
• Roots of Star Events
• Ultimate-Definite and Symmetric-Definite Events and Automata
• The Theory of Definite Automata
• Regularity preserving modifications of regular expressions
• Generalizations of regular events
• A Procedure for Checking Equality of Regular Expressions
• Lower Bound of the Number of Threshold Functions
• Two Complete Axiom Systems for the Extended Language of Regular Expressions
• Boolean Matrices and the Stability of Neural Nets
• Title not available (Why is that?)
• General properties of star height of regular events
• The loop complexity of pure-group events
• Title not available (Why is that?)
• A Survey of Regular Expressions and Their Applications
• Lattice-Ordered Semigroups, Graphs, and Automata
• Finite counting automata
• On a question of Eggan
• On some properties of the free monoids with applications to automata theory
• Stochastische Ereignisse und Wortmengen
• Title not available (Why is that?)
• Serial-to-Parallel Transformation of Linear-Feedback Shift-Register Circuits
• Title not available (Why is that?)
• The theory of sequential relations
• A Diagrammatic Approach to Multilevel Logic Synthesis
• Realization of Events by Logical Nets
• Title not available (Why is that?)
• On Concatenative Decompositions of Regular Events
• Design of Sequential Machines from Their Regular Expressions
• On a class of regular sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the usage of contour integrals in inventory and queueing problems
• Simultaneous processing of jobs on an electronic computer
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Construction of Sequential Machines from Regular Expressions
• Title not available (Why is that?)
• Über Die Darstellbarkeit Von Ereignissen in Nicht‐Initialen Automaten
• Über die Konstruktion endlicher Automaten
• Author's reply
• Polylinear Sequential Circuit Realizations of Finite Automata
• Title not available (Why is that?)
• Canonical representations of chain events

Cited In (18)

• Accepting networks of evolutionary processors with subregular filters
• Title not available (Why is that?)
• Networks of evolutionary processors: the power of subregular filters
• Simple splicing systems
• Remarks on context-free grammars with subregular control languages
• Concatenation-free languages
• Generative Capacity of Contextual Grammars with Subregular Selection Languages*
• Relations of contextual grammars with strictly locally testable selection languages
• Aspects of Reversibility for Classical Automata
• Accepting networks of evolutionary processors with resources restricted and structure limited filters
• Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars
• Finite automata with undirected state graphs
• Merging two hierarchies of external contextual grammars with subregular selection
• Title not available (Why is that?)
• Determination of finite automata accepting subregular languages
• Expressive Capacity of Concatenation Freeness
• Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity
• Title not available (Why is that?)

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)