scientific article; zbMATH DE number 3420624
From MaRDI portal
Publication:5684962
zbMath0266.94019MaRDI QIDQ5684962
No author found.
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to information and communication theory (94-06) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Conference proceedings and collections of articles (00Bxx) Computability and recursion theory (03Dxx)
Related Items (48)
The Complexity of Coloring Circular Arcs and Chords ⋮ Improved bounds for colouring circle graphs ⋮ Pattern matching for permutations ⋮ On the notion of infinite pseudorandom sequences ⋮ Signed enumeration of upper-right corners in path shuffles ⋮ On decomposing polygons into uniformly monotone parts ⋮ Embedding planar graphs in four pages ⋮ Minimal auxiliary Markov chains through sequential elimination of states ⋮ Sorting with networks of data structures ⋮ Queue layouts of iterated line directed graphs ⋮ RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties ⋮ On the Hierarchy of Block Deterministic Languages ⋮ Permutations generated by token passing in graphs ⋮ Embedding planar 5-graphs in three pages ⋮ Sorting using networks of deques ⋮ Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics ⋮ Smallest Formulas for Parity of 2 k Variables Are Essentially Unique ⋮ A mathematical formulation and complexity considerations for the blocks relocation problem ⋮ Nondeterministic Moore automata and Brzozowski's minimization algorithm ⋮ Partial characterizations of circle graphs ⋮ On extremal cases of Hopcroft's algorithm ⋮ Structural results on circular-arc graphs and circle graphs: a survey and the main open problems ⋮ Synchronizing Automata and the Černý Conjecture ⋮ Hopcroft’s Algorithm and Cyclic Automata ⋮ Comparability graphs and intersection graphs ⋮ Graph layouts via layered separators ⋮ Invariant and geometric aspects of algebraic complexity theory. I ⋮ Random languages for nonuniform complexity classes ⋮ Circle graphs and monadic second-order logic ⋮ A series of slowly synchronizing automata with a zero state over a small alphabet ⋮ Minimum weight feedback vertex sets in circle graphs ⋮ Description and analysis of a bottom-up DFA minimization algorithm ⋮ Permutations of a multiset avoiding permutations of length 3 ⋮ The enumeration of permutations sortable by pop stacks in parallel ⋮ Intersection graphs of curves in the plane ⋮ Techniques for separating space complexity classes ⋮ Hopcroft’s Minimization Technique: Queues or Stacks? ⋮ Upper bounds on the queue number of \(k\)-ary \(n\)-cubes ⋮ A note on almost-everywhere-complex sets and separating deterministic- time-complexity classes ⋮ Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design ⋮ Container ship stowage problem complexity and connection to the coloring of circle graphs ⋮ Černý's conjecture and the road colouring problem ⋮ Every discrete input machine is linearly simulatable ⋮ Distributions of pattern statistics in sparse Markov models ⋮ Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture ⋮ Forbidden induced subgraph characterization of circle graphs within split graphs ⋮ Decomposing a set of points into chains, with applications to permutation and circle graphs ⋮ Permuting machines and priority queues
This page was built for publication:
