THE ABSTRACT THEORY OF AUTOMATA
From MaRDI portal
Publication:3289362
DOI10.1070/RM1961V016N05ABEH004112zbMath0104.35404MaRDI QIDQ3289362
Publication date: 1962
Published in: Russian Mathematical Surveys (Search for Journal in Brave)
Related Items (only showing first 100 items - show all)
FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS ⋮ Translating regular expressions into small ε-free nondeterministic finite automata ⋮ NORMALIZED EXPRESSIONS AND FINITE AUTOMATA ⋮ Glushkov Construction For Series: The Non Commutative Case ⋮ Quasi-injectivity of partially ordered acts ⋮ The Degree of Irreversibility in Deterministic Finite Automata ⋮ Minimized Thompson NFA ⋮ Realization of monoids on sets ⋮ Algorithms for minimization of finite acyclic automata and pattern matching in terms ⋮ Iterative methods of program analysis: Equalities and inequalities ⋮ Tree pattern matching from regular tree expressions ⋮ Abstract biological systems as sequential machines ⋮ Deterministic regular languages ⋮ Fast matching of regular patterns with synchronizing counting ⋮ The net automaton of a rational expression ⋮ Left is Better Than Right for Reducing Nondeterminism of NFAs ⋮ Location automata for regular expressions with shuffle and intersection ⋮ Smaller representation of compiled regular expressions ⋮ Space-Efficient Representations for Glushkov Automata ⋮ Free left n-trinilpotent trioids ⋮ ON THE AVERAGE SIZE OF GLUSHKOV AND PARTIAL DERIVATIVE AUTOMATA ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Synthesis of multifunction and universal logic elements over residue class rings. I ⋮ NONDETERMINISTIC BIAUTOMATA AND THEIR DESCRIPTIONAL COMPLEXITY ⋮ One-unambiguous regular languages ⋮ One-unambiguous regular languages ⋮ FROM REGULAR WEIGHTED EXPRESSIONS TO FINITE AUTOMATA ⋮ Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata ⋮ How expressions can code for automata ⋮ Efficient logic design of reliable control units. II ⋮ From regular expressions to finite automata∗ ⋮ Subset construction complexity for homogeneous automata, position automata and ZPC-structures ⋮ On Average Behaviour of Regular Expressions in Strong Star Normal Form ⋮ Switching functions for a residue-class complementary-code scheme ⋮ Check of linear combination circuits ⋮ Mapping of reduced disjunctive normal forms onto graphs ⋮ BRUTE FORCE DETERMINIZATION OF NFAs BY MEANS OF STATE COVERS ⋮ An Efficient Algorithm for the Construction of the Equation Tree Automaton ⋮ Recognition of properties of autonomous structural automata ⋮ Graphical Conjunctive Queries. ⋮ FROM THE $\mathcal{ZPC}$ STRUCTURE OF A REGULAR EXPRESSION TO ITS FOLLOW AUTOMATON ⋮ From Regular Expression Matching to Parsing ⋮ Comparative analysis of automata with a common input alphabet ⋮ Translation of sequential program schemes into data-flow schemes ⋮ Monitoring the behavior of semigroup systems ⋮ Functional completeness in the class of speed-independent circuits. I ⋮ Inclusion Test Algorithms for One-Unambiguous Regular Expressions ⋮ Abstract biological systems as sequential machines: III. Some algebraic aspects ⋮ The Bottom-Up Position Tree Automaton and the Father Automaton ⋮ Simplified analysis of finite automata ⋮ Derivatives of Regular Expressions and an Application ⋮ Algorithms for Kleene algebra with converse ⋮ One-unambiguity of regular expressions with numeric occurrence indicators ⋮ Functions without short implicants. II: Construction ⋮ Algebraic interpretation of a microprogram finite-state machine with datapath of transitions ⋮ Derived-Term Automata for Extended Weighted Rational Expressions ⋮ THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS ⋮ Interleaving isotactics -- an equivalence notion on behaviour abstractions ⋮ Automaton synthesis from a nonformal specification ⋮ Prefix and Right-Partial Derivative Automata ⋮ Manipulation of regular expressions using derivatives: an overview ⋮ How to settle the ReDoS problem: back to the classical automata theory ⋮ The validation of SGML content models ⋮ Regular algebra of functionals of labeled trees ⋮ Control design for nondeterministic input/output automata ⋮ Obtaining shorter regular expressions from finite-state automata ⋮ Efficient testing and matching of deterministic regular expressions ⋮ Functions realizable by one-dimensional iterative systems ⋮ Automata for XML -- a survey ⋮ Multilevel synthesis of structured programs ⋮ Hardware Implementations of Finite Automata and Regular Expressions ⋮ Deciding Synchronous Kleene Algebra with Derivatives ⋮ On the Hierarchy of Block Deterministic Languages ⋮ Local design of standardized automata. II ⋮ The control problem for a cascade coupling of automata ⋮ Analysis of behaviour of automata ⋮ Reconstruction of automata by fragments of behaviour ⋮ Acts over semigroups ⋮ Efficient weighted expressions conversion ⋮ Location automata for synchronised shuffle expressions ⋮ Mathematical model of microprogram formation based on optimized structure of the control automaton ⋮ An algorithm to construct the basis of the intersection of finitely generated free groups ⋮ Efficiency of certain algorithms of combinatorial group theory ⋮ Construction of Tree Automata from Regular Expressions ⋮ Representations of (M,R)-systems by categories of automata ⋮ Follow automata. ⋮ Reducing NFAs by invariant equivalences. ⋮ Adding pebbles to weighted automata: easy specification \& efficient evaluation ⋮ Optimization of circuits of compositional microprogram control units implemented on FPGA ⋮ Finite-state automata in information technologies ⋮ Glushkov's evidence algorithm ⋮ Periodic discrete-time one-channel \(GI/G/1\) retrial queuing system with FCFS service discipline ⋮ Postfix automata ⋮ Path constraints in semistructured data ⋮ Nonlinear automata over a finite ring ⋮ Location based automata for expressions with shuffle ⋮ Extended to multi-tilde-bar regular expressions and efficient finite automata constructions ⋮ The word problem for visibly pushdown languages described by grammars ⋮ Deciding determinism of regular languages
This page was built for publication: THE ABSTRACT THEORY OF AUTOMATA
