scientific article; zbMATH DE number 3251424
From MaRDI portal
Publication:5536277
zbMath0156.25501MaRDI QIDQ5536277
No author found.
Publication date: 1960
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
Topologies for error-detecting variable-length codes ⋮ Smaller representation of compiled regular expressions ⋮ Combining Partial Specifications using Alternating Interface Automata ⋮ Derivatives of Regular Expressions and an Application ⋮ Algebraic program analysis ⋮ Translating regular expressions into small ε-free nondeterministic finite automata ⋮ Transitive closure and related semiring properties via eliminants ⋮ One-unambiguity of regular expressions with numeric occurrence indicators ⋮ Derived-Term Automata for Extended Weighted Rational Expressions ⋮ Prolog infinite trees and automata ⋮ A matrix-linguistic method of analyzing finite discrete dynamic systems ⋮ On recognizable subsets of free partially commutative monoids ⋮ On the decidability of infix inclusion problem ⋮ The Billaud conjecture for \(|\varSigma| = 4\), and beyond ⋮ 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 ⋮ Obtaining shorter regular expressions from finite-state automata ⋮ Tree pattern matching from regular tree expressions ⋮ Techniques for establishing star height of regular sets ⋮ Über die Konstruktion endlicher Automaten ⋮ Hardware Implementations of Finite Automata and Regular Expressions ⋮ From regular expressions to DFA's using compressed NFA's ⋮ Controlled pushdown automata ⋮ Left is Better Than Right for Reducing Nondeterminism of NFAs ⋮ Completeness and the finite model property for Kleene algebra, reconsidered ⋮ Location automata for regular expressions with shuffle and intersection ⋮ Efficient weighted expressions conversion ⋮ Two-way representations and weighted automata ⋮ Acyclic automata and small expressions using multi-tilde-bar operators ⋮ Provably Shorter Regular Expressions from Deterministic Finite Automata ⋮ Construction of Tree Automata from Regular Expressions ⋮ Follow automata. ⋮ Reducing NFAs by invariant equivalences. ⋮ Adding pebbles to weighted automata: easy specification \& efficient evaluation ⋮ Space-Efficient Representations for Glushkov Automata ⋮ Unnamed Item ⋮ On series-parallel pomset languages: rationality, context-freeness and automata ⋮ 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 ⋮ Partial derivatives of regular expressions and finite automaton constructions ⋮ Local languages and the Berry-Sethi algorithm ⋮ Generalizations of 1-deterministic regular languages ⋮ Dépliage d'un graphe pointé en un cactus ⋮ A comment on ``Construction of fuzzy automata from fuzzy regular expressions ⋮ The inclusion problem for regular expressions ⋮ Construction of fuzzy automata from fuzzy regular expressions ⋮ Derivatives and Finite Automata of Expressions in Star Normal Form ⋮ Theories of automata on \(\omega\)-tapes: a simplified approach ⋮ One-unambiguous regular languages ⋮ Fuzzy neural networks ⋮ One-unambiguous regular languages ⋮ The Burnside problem for semigroups ⋮ Compositional synthesis of asynchronous automata ⋮ Derivatives of rational expressions with multiplicity ⋮ Fuzzy automata with \(\varepsilon\)-moves compute fuzzy measures between strings ⋮ Vacuity in practice: temporal antecedent failure ⋮ Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata ⋮ Noiselike transforms of \(\omega\)-events ⋮ A mesh of automata ⋮ Multi-tilde-bar expressions and their automata ⋮ How expressions can code for automata ⋮ A New Family of Regular Operators Fitting with the Position Automaton Computation ⋮ From regular expressions to smaller NFAs ⋮ From regular expressions to deterministic automata ⋮ Subset construction complexity for homogeneous automata, position automata and ZPC-structures ⋮ Multi-tilde Operators and Their Glushkov Automata ⋮ Optimal Lower Bounds on Regular Expression Size Using Communication Complexity ⋮ Disambiguation in Regular Expression Matching via Position Automata with Augmented Transitions ⋮ Regular Expressions at Their Best: A Case for Rational Design ⋮ Semirings and path spaces ⋮ Unnamed Item ⋮ Position Automaton Construction for Regular Expressions with Intersection ⋮ Hedge Pattern Partial Derivative ⋮ Implementation of State Elimination Using Heuristics ⋮ Small Extended Expressions for Acyclic Automata ⋮ From Regular Expression Matching to Parsing ⋮ Construction of tree automata from regular expressions ⋮ Derivative-Based Diagnosis of Regular Expression Ambiguity ⋮ Star height of certain families of regular events ⋮ Automata and rational expressions ⋮ Descriptional complexity of regular languages ⋮ Enumerating regular expressions and their languages ⋮ An optimal parallel algorithm to convert a regular expression into its Glushkov automaton ⋮ Generation, recognition and parsing of context-free languages by means of recursive graphs ⋮ Characterization of Glushkov automata ⋮ Solvable classes of discrete dynamic programming ⋮ Unnamed Item ⋮ Inclusion Test Algorithms for One-Unambiguous Regular Expressions ⋮ From regular expression matching to parsing ⋮ Unnamed Item ⋮ The complexity of restricted regular expressions and the synthesis problem for finite automata ⋮ From Two-Way Transducers to Regular Function Expressions ⋮ The Bottom-Up Position Tree Automaton and the Father Automaton ⋮ Canonical derivatives, partial derivatives and finite automaton constructions. ⋮ Construction of recognition devices for regular languages from their Backus Normal Form definition ⋮ An efficient recognizer for the Boolean closure of context-free languages ⋮ Kleene Theorems for Synchronous Products with Matching ⋮ Operads, quasiorders, and regular languages
This page was built for publication:
