scientific article; zbMATH DE number 3390671
From MaRDI portal
Publication:5659467
zbMATH Open0246.94029MaRDI QIDQ5659467FDOQ5659467
Authors: István Peák, Ferenc Gécseg 
Publication date: 1971
Title of this publication is not available (Why is that?)
Formal languages and automata (68Q45) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)
Cited In (41)
- On the equivalence of Mealy-type and Moore-type automata and a relation between reducibility and Moore-reducibility
- Automata and finite model theory
- An algebraic theory of interface automata
- Title not available (Why is that?)
- Automata algebras
- A bialgebraic approach to automata and formal language theory
- Remarks on external contextual grammars with selection
- On Kleene algebras
- Amalgamated free product in terms of automata constructions
- Automata for solid codes
- Generating series for bilinear hybrid systems
- Span-reachability and observability of bilinear hybrid systems
- Title not available (Why is that?)
- Symmetry principles via interactions and symmetry-violations.
- On some algebraic properties of automata
- Profinite Methods in Automata Theory
- Equational properties of Kleene algebras of relations with conversion
- New results on the generalized star-height problem
- On structure and representations of cyclic automata
- On the star-height of subword counting languages and their relationship to Rees zero-matrix semigroups
- On \(\alpha _{2} - \nu _{2}\)-products of automata
- Systems of generators of automaton permutations groups
- General metrics and contracting operations
- Foundations of a theory of synchronous systems
- \(n\)-ary Cartesian composition of automata
- Polynomial-time algorithms for testing strong isomorphism and computing the automorphism group of \(R\)-strongly connected automata
- An algebraic model of synchronous systems
- Complete classes of automata for the \(\alpha _ 0\)-product
- An equational axiomatization of systolic systems
- Efficient simplicity testing of automata
- Unary algebras, semigroups and congruences on free semigroups
- Left reductive congruences on semigroups.
- Realization theory for linear switched systems: formal power series approach
- On the notion of persistence of excitation for linear switched systems
- On \(\alpha{}_ 0-\nu{}_ 1\)-products of automata
- Algebraic Theory of Automata and Languages
- Title not available (Why is that?)
- Halbgruppen und Automaten
- Finite automata and algebraic extensions of functions fields
- Automata represented by products of soliton automata
- Soliton automata
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 Q5659467)
