Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2776607
Jump to:navigation, search

zbMath0992.68131MaRDI QIDQ2776607

John E. Hopcrofts

Publication date: 28 February 2002


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

automata theory


Mathematics Subject Classification ID

Formal languages and automata (68Q45) History of computer science (68-03)


Related Items (15)

STAR-FREE GEODESIC LANGUAGES FOR GROUPS ⋮ STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-STAR AND CATENATION-REVERSAL ⋮ FORMAL DESCRIPTIONS OF CODE PROPERTIES: DECIDABILITY, COMPLEXITY, IMPLEMENTATION ⋮ THE FINITE TILING PROBLEM IS UNDECIDABLE IN THE HYPERBOLIC PLANE ⋮ BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS ⋮ A class of simpleC*-algebras arising from certain non-sofic subshifts ⋮ On the operating unit size of load/store architectures ⋮ Signed real measure of regular languages for discrete-event automata ⋮ One-Time Nondeterministic Computations ⋮ Maurer computers for pipelined instruction processing ⋮ ORTHOGONAL SHUFFLE ON TRAJECTORIES ⋮ CONFLICTS AND FAIR TESTING ⋮ Nonlinear phenomena in spaces of algorithms ⋮ Nature computes: Information processing in quantum dynamical systems ⋮ A geometric approach to complexity




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2776607&oldid=15665145"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 16:09.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki